mattb314

7 ms·

31.
by mattb314 10y ago
Wait, Fauna uses the Calvin protocol? Would you mind linking a white paper? I didn't realize it was in use outside Calvin/CalvinFS.
32.
by mattb314 10y ago
It looks correct to me, but keep in mind that deleting elements from the middle of an array is O(n), so overall your algorithm is O(n^2). You could fix this by always swapping your chosen element with the last element of the sorted_deck bef
33.
by mattb314 10y ago
"As such, R^2 answers the question: 'does my model perform better than a constant model?' But we often would like to answer a very different question: 'does my model perform worse than the true model?' " Maybe
34.
by mattb314 10y ago
Your linked blog post was a really good read, but I'm not totally sure if the correct takeaway was that brute force outperforms "clever" algorithms. Unless I misinterpreted the results, FLANN and Annoy (which implement hierar
35.
by mattb314 10y ago
To be fair, as Lxr points out below, big O notation is an upper bound on the growth rate of a function, and since 2^N grows faster (asymptotically) than (1.618...)^N, O(Fib(N)) <= O(1.618...^N) <= O(2^N) (with some abuse of notation),
36.
by mattb314 11y ago
Worth noting that (a) this is an analysis of scientific consensus, so environmental effects (like the "arctic methane positive feedback loop") should already be included in the numbers if such effects are significant, and (b) GP w
37.
by mattb314 11y ago
The accompanying paper[1] claims the phone lasts four hours running the current version of fingerIO, but also that improvements could be made to preserve power (such as reducing the sampling rate). [1] http://fingerio.cs.washingt
38.
by mattb314 11y ago
Probably the second example here [1] for those curious (I think the integral of sin(x)*e^x dx is the only place I've seen this used, would love to know if there are other examples). [1] https://en.m.wikipedia.org/wiki&#
39.
by mattb314 11y ago
The linked article is a little over-hyped, but the paper authors themselves acknowledge that their system is simply a really cool example of parallel computing and doesn't solve or avoid the P?=NP problem. From the paper: "...it i
40.
by mattb314 11y ago
If you are referring to the law invoked in the Apple case (the All Writs Act), a company unable to comply does not face legal consequences. From Wikipedia: "In the case U.S. v. New York Telephone Co. 434 U.S. 159 (1977), the Supreme Co
41.
by mattb314 11y ago
I think the argument here is that stealing a private key isn't fundamentally more difficult than stealing this iOS backdoor (were Apple to create it). Under this model, Apple's refusal to create a backdoor is in some sense an appe