Conference paper
The predictive power of online chatter
Daniel Gruhl, R. Guha, et al.
KDD 2005
Paper
On polynomial-factor approximations to the shortest lattice vector length
Abstract
For every constant ε > 0, we obtain a 2O(n(1/2+1/ε)) time randomized algorithm to approximate the length of the shortest vector in an n-dimensional lattice to within a factor of n3+ε.
Related
T.S. Jayram, Subhash Khot, et al.
Journal of Computer and System Sciences
Conference paper
Multi-Structural Databases
Ronald Fagin, R. Guha, et al.
SIGMOD/PODS/ 2005
David Liben-Nowell, Jasmine Novak, et al.
PNAS