Conference paper
Comparing top k lists
Ronald Fagin, Ravi Kumar, et al.
SODA 1998
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
Harry Buhrman, Dieter Van Melkebeer, et al.
SIAM Journal on Computing
Conference paper
Unweaving a web of documents
R. Guha, D. Sivakumar, et al.
KDD 2005
Conference paper
Self-similarity in the web
Stephen Dill, Ravi Kumar, et al.
VLDB 2001