Sciweavers

Share
343 search results - page 1 / 69
» Random Indexing Revisited
Sort
View
NLDB
2015
Springer
4 years 3 months ago
Random Indexing Revisited
Random indexing is a method for constructing vector spaces at a reduced dimensionality. Previously, the method has been proposed using Kanerva’s sparse distributed memory model. ...
Behrang QasemiZadeh
WWW
2006
ACM
10 years 8 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»
9 years 8 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»
9 years 8 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»
9 years 7 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
books