221 search results - page 10 / 45 » Random Indexing K-tree |
CIKM
2008
Springer
13 years 9 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 ...
ARCS
2004
Springer
14 years 23 days 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...
LATIN
2010
Springer
13 years 9 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...
RIAO
2000
13 years 8 months ago
2000
We propose an original approach for the characterization of video dynamic content with a view to supplying new functionalities for motion-based video indexing and retrieval with q...
SCIENTOMETRICS
2011
13 years 2 months ago
2011
The h-index has received an enormous attention for being an indicator that measures the quality of researchers and organizations. We investigate to what degree authors can inflate...