modalduality

7 ms·

31.
by modalduality 9y ago
Often in approximations you can prove an upper bound on the optimal solution, even if you don't know the optimal solution itself. An easy example is by using duality when solving linear programs. And sometimes your upper bound is close
32.
by modalduality 9y ago
The issue isn't about approximating a TSP instance, but ensuring that points aren't too far apart from each other, even at the cost of increasing total length. I can't immediately think of a reduction that would factor this i
33.
by modalduality 9y ago
Recurse Center: https://www.recurse.com/ . Anecdotally, not so easy to get in.
34.
by modalduality 9y ago
I don't see why this wouldn't be possible, just tell Nginx (or whatever proxy) to serve one on 443 with appropriate TLS options and the root domain on 80. To a large extent subdomains are treated as different sites w.r.t. security
35.
by modalduality 9y ago
Interesting game. I have been looking for a web-based turn based strategy game for a while, this looks promising. Some thoughts: 1. Let the user press Enter or Space to go to the next dialog in the tutorial. 2. Let the user press Escape or
36.
by modalduality 9y ago
Huh, you're correct. My professor said doubly-efficient IPs were used in Zcash, maybe he just meant as inspiration?
37.
by modalduality 9y ago
Some context: doubly efficient interactive proofs are one of the fundamental ideas that make Zcash possible on modern hardware.
38.
by modalduality 9y ago
I believe the error is only in the incremental algorithm. Spoiler: https://people.eecs.berkeley.edu/~jrs/meshpapers/GSflaws .
39.
by modalduality 9y ago
Another particular interesting representation is Guibas and Stolfi's "quadedge" data structure from their 1985 paper at "Primitives for the manipulation of general subdivisions and the computation of Voronoi," sourc
40.
by modalduality 9y ago
>It's a bit like writing a best selling novel in a language you don't speak: theoretically possible, but just so far from normal reality that it's hard to suspend disbelief. Jhumpa Lahiri managed to do this! See http:&#x2
41.
What does the Rigveda say about dairy in the United States?(modalduality.org)
1 points by modalduality 9y ago|0 comments
42.
by modalduality 10y ago
It was a joke about "Tau Day," on June 28th.
43.
by modalduality 10y ago
For context, this is a special case of Haskell's monads, which was also adopted by languages like Swift.
44.
by modalduality 10y ago
I'm not quite able to run the code (too much load on the server probably). But is this something that can solve LPs in the browser (possibly more than just LPs, I think)? This would be incredibly helpful for many people I'm sure--
45.
by modalduality 10y ago
Generally people won't sign garbage or random documents, so Document A has to be of a very specific subset of documents a person would sign. Then finding Document B constitutes a second pre-image attack.
46.
by modalduality 10y ago
One-way functions are not cryptographic hash functions, which have the three properties preimage resistance, second preimage resistance, and collision resistance. For example, say f(x) is a one-way function. Then define g(0x) = f(x) g(1x) =
47.
by modalduality 10y ago
If you like math you may be interested in my companion piece Optimizing Differentiability in Weighted-Frequency Color Coding at https://modalduality.org/posts/optimizing-color-coding/ where I try to choose the mo
48.
Semantic Traveler Wristbands(modalduality.org)
2 points by modalduality 10y ago|1 comments
49.
by modalduality 10y ago
The problem is, they can't be held accountable if no one knows what they're doing (how they process data, how they store data, etc.).