EricBurnett

17 ms·

91.
by EricBurnett 14y ago
1, privacy - they would have to send you a copy of someone's video for that. 2, I expect the end user bandwidth is worth more than the CPU time you'd provide, so the credits they could give wouldn't be worth it to you.
92.
by EricBurnett 14y ago
The same could be said for any binary releases, from open source code or not (e.g. Firefox). If you don't trust Google's binary releases then build your own Chromium from audited sources.
93.
by EricBurnett 14y ago
In what way was it 'designed' to not operate independently? The browser is - in theory - perfectly fine operating when sync is broken (and in fact wouldn't have triggered this were sync fully unreachable). This was simply a bug in sanitizin
94.
by EricBurnett 14y ago
One correction: assuming the disk access was for files scattered around on the drive, requiring a seek each, you're looking at 10ms per file. At 1,000 files (wild guess) that's 10 seconds.
95.
by EricBurnett 14y ago
(Disclaimer: I work for Google, but not in websearch, and this is my personal opinion only) If this is a serious statement, then let me give you a serious answer: any minor increase in processing power won't inconvenience Google in the slig
96.
by EricBurnett 14y ago
I've used that paper as the impetuous for writing a few sieve algorithms (see [1] and [2]). While reasonably elegant in Haskell, my personal experience is that list-of-generator style programs cannot compare to array-based sieves for perfor
97.
by EricBurnett 14y ago
As ahh points out in their comment, this isn't a true sieve - it's essentially trial division, although sharded between goroutines. For comparison, I've used Go to implement a segmented version of the true Sieve of Eratosthenes. It's a stan
98.
by EricBurnett 14y ago
Even from early beta versions it's been surprisingly addicting. The first time I tried it I went for a walk, and found myself still wandering the streets at 2am, only returning home when my battery was giving out :). If I'm at all average,
99.
by EricBurnett 14y ago
IANAL, but my understanding is the bond is posted against the losses the injunction could cause as a means to ensure payment, but the plaintiff - Apple - is actually on the hook for the real losses in the end (whether more or less). As such
100.
by EricBurnett 14y ago
Note that the redress for lost sale is yet to be determined. Samsung may get some or all of the 2.6M bond Apple posted at the start of the injunction, although how much isn't clear.
101.
by EricBurnett 14y ago
Substitute Seattle for Manhattan and the point stands.
102.
by EricBurnett 14y ago
Disclaimer: I've never heard of Hipset before. That said, I'm going to go out on a limb and say it won't take off, for all the same reasons this blog post says it will. The product itself appears to be essentially a 'simple' algorithm for F
103.
by EricBurnett 14y ago
Cached copy provided by Yahoo: http://74.6.238.254/search/srpcache?ei=UTF-8&p=http%3A%2...
104.
by EricBurnett 14y ago
That very much depends on the size of the solution space. If they get one bit of 'answer' from each qubit used in the computation that's 2^81 possible solutions, in which case you'd expect random chance to require somewhere around 1,000,000
105.
by EricBurnett 14y ago
Do you mean this IndexedDB? http://caniuse.com/#feat=indexeddb . Or this calc? http://caniuse.com/#feat=calc . They look pretty supported to me, remembering that they're both based on a draft specs.
106.
The Olympics Unpeeled(thinkwithgoogle.com)
1 points by EricBurnett 14y ago|0 comments
107.
Does programming a computer make a new machine? (2012)(groklaw.net)
4 points by EricBurnett 14y ago|0 comments
108.
by EricBurnett 14y ago
Sadly not - instead you'd get disagreement from the two structures, with no way to resolve it. If the bloom filter says 'yes I've seen it!', and the opposite filter says 'nope, not here', which is accurate? You know it's either a false-posi
109.
by EricBurnett 14y ago
Thanks, I wasn't aware they changed regularly. From what I can find, 4 v4 IPs have changed since 1997, plus the addition of a number of v6 IPs over the years. I'd be curious to know the last time all IPs were different, if ever.
110.
by EricBurnett 14y ago
Yes and no. There are 13 'installations' (essentially IPs), some anycasted, but they all serve the same contents that are provided by the ICANN. So they are one conceptual root, albeit a geographically distributed one. The IETF has worked h
111.
by EricBurnett 14y ago
Setting aside the motivations for this draft, the idea of removing the one single DNS 'root' is a reasonable one. It acts as a single point of failure for the DNS system and puts the entire DNS hierarchy under the jurisdiction of the United
112.
by EricBurnett 14y ago
Deliberately gloss over it? Second paragraph of the abstract: > The strong consistency properties of F1 and its storage system come at the cost of higher write latencies compared to MySQL. Having successfully migrated a rich customerfac
113.
by EricBurnett 15y ago
They do link to the code: https://github.com/JuliaLang/julia/tree/master/test/perf . It doesn't look like a very reliable microbenchmark - run test x 5 times - but it should provide a useful starting point if you want to run your own.
114.
by EricBurnett 15y ago
If you don't want to be found, no. If you do, adding a nickname to your profile on Google+ will (either now or eventually) allow them to make that connection.
115.
by EricBurnett 15y ago
If the article's premise is true, that there's a decline in the belief in magic due to having more information at your fingertips, that's good news to me. Sure, it'll mean a decline in the magic industry specifically (although it'll never d
116.
by EricBurnett 15y ago
Reply to mindcrime sibling post I've seen that before myself at other companies, and it's a shame. A healthy codebase is an investment in the future - if you're not taking the time to cultivate it you're sacrificing long term usability fo
117.
by EricBurnett 15y ago
is anybody going to parse through all of that? Yes, in fact. We have some great tools that give us full search over our entire codebase (think Google Code Search), and you can add a dependency on a piece of code without needing to have it
118.
by EricBurnett 15y ago
Pointing at a big company and saying "they're doing it wrong" is easy enough to do, but you have to remember that every decision comes with tradeoffs. Take Google's codebase, since it's the one I know the best. A couple of the key decisions
119.
Show HN: Visualization of the Marriage Sort algorithm(thelowlyprogrammer.com)
1 points by EricBurnett 15y ago|0 comments
120.
by EricBurnett 15y ago
The worldwide internet infrastructure is remarkably fragile. I can think of a few example off the top of my head where it's been abused or broken: 1. China 'borrowing' traffic: http://arstechnica.com/security/news/2010/11/how-china-swall..

More ›