Sciweavers

330 search results - page 1 / 66
» Random Indexing Revisited
Sort
View
WWW
2006
ACM
14 years 5 months ago
Random sampling from a search engine's index
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
Ziv Bar-Yossef, Maxim Gurevich
JC
2006
62views more  JC 2006»
13 years 4 months ago
Random non-cupping revisited
Say that Y has the strong random anticupping property if there is a set A such that for every Martin-L
George Barmpalias
CORR
2010
Springer
145views Education» more  CORR 2010»
13 years 4 months ago
Random Indexing K-tree
Random Indexing K-tree is the combination of two algorithms suited for large scale document clustering. Keywords Random Indexing, K-tree, Dimensionality Reduction, B-tree, Search T...
Christopher M. De Vries, Lance De Vine, Shlomo Gev...
CORR
2000
Springer
93views Education» more  CORR 2000»
13 years 4 months ago
The Random Oracle Methodology, Revisited
We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing...
Ran Canetti, Oded Goldreich, Shai Halevi
LREC
2008
153views Education» more  LREC 2008»
13 years 5 months ago
Using Random Indexing to improve Singular Value Decomposition for Latent Semantic Analysis
We present results from using Random Indexing for Latent Semantic Analysis to handle Singular Value Decomposition tractability issues. We compare Latent Semantic Analysis, Random ...
Linus Sellberg, Arne Jönsson