330 search results - page 25 / 66 » Random Indexing Revisited |
ICDE
2008
IEEE
15 years 6 months ago
2008
IEEE
Personalized PageRank, related to random walks with restarts and conductance in resistive networks, is a frequent search paradigm for graph-structured databases. While efficient ba...
140
Voted
ERSHOV
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Searching in metric spaces is a very active field since it offers methods for indexing and searching by similarity in collections of unstructured data. These methods sele...
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
92
Voted
ARCS
2004
Springer
15 years 5 months ago
2004
Springer
Searching in decentralized peer-to-peer networks is a challenging problem. In common applications such as Gnutella, searching is performed by randomly forwarding queries to all pee...
104
click to vote
LATIN
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we describe algorithms for computing the BWT and for building (compressed) indexes in external memory. The innovative feature of our algorithms is that they are light...