Sciweavers

85 search results - page 3 / 17
» stoc 2009
Sort
View
STOC
2009
ACM
137views Algorithms» more  STOC 2009»
14 years 11 months ago
Mixing time for the solid-on-solid model
We analyze the mixing time of a natural local Markov chain (the Glauber dynamics) on configurations of the solid-onsolid model of statistical physics. This model has been proposed...
Fabio Martinelli, Alistair Sinclair
STOC
2009
ACM
182views Algorithms» more  STOC 2009»
14 years 11 months ago
Approximating edit distance in near-linear time
We show how to compute the edit distance between two strings of length n up to a factor of 2 ~O( log n) in n1+o(1) time. This is the first sub-polynomial approximation algorithm f...
Alexandr Andoni, Krzysztof Onak
STOC
2009
ACM
238views Algorithms» more  STOC 2009»
14 years 5 months ago
Fully homomorphic encryption using ideal lattices
We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in t...
Craig Gentry
STOC
2009
ACM
119views Algorithms» more  STOC 2009»
14 years 11 months ago
Explicit construction of a small epsilon-net for linear threshold functions
We give explicit constructions of epsilon nets for linear threshold functions on the binary cube and on the unit sphere. The size of the constructed nets is polynomial in the dime...
Yuval Rabani, Amir Shpilka
STOC
2009
ACM
118views Algorithms» more  STOC 2009»
14 years 5 months ago
How long does it take to catch a wild kangaroo?
The discrete logarithm problem asks to solve for the exponent x, given the generator g of a cyclic group G and an element h ∈ G such that gx = h. We give the first rigorous pro...
Ravi Montenegro, Prasad Tetali