anchovy_

5 ms·

1. 1.▲
   by anchovy_ 1y ago

   Tangentially related: can anyone here recommend some good resources (preferably even books) on hypervisors? Back in university we got a brief introduction into the topic but I was always interested in learning about it more in depth.
2. 2.▲
   by anchovy_ 3y ago

   Cool idea! Is there a way to go to the arxiv page ( https://arxiv.org/abs/ ...) of a paper instead of only going to the PDF ( https://arxiv.org/pdf/ ...) without manually manipulating the URL?
3. 3.▲
   by anchovy_ 3y ago

   Don't nail me down on this but I think since nowadays' websites are often dynamic, you most likely have to employ headless browsers in order to do whatever it is you want to do. This should then result in fake impressions.
4. 4.▲
   by anchovy_ 3y ago

   >However, an O(n^3) algorithm will always loose out to an O(n^2*log(n)) algorithm, when the input gets big enough. Sure, this might be the case from a theoretical point of view (as per definition) but this completely disregards the hidde
5. 5.▲
   by anchovy_ 3y ago

   I don't know about Swabia and Franconia but if you are in Upper Bavaria (or probably any part of Altbayern [0]) and order a beer (without specifying anything else), you will definitely get a Helles. [0] https://en.wikipedia.