Sciweavers

99 search results - page 12 / 20
» Compression, Indexing, and Retrieval for Massive String Data
Sort
View
ACSC
2000
IEEE
15 years 1 months ago
Needles and Haystacks: A Search Engine for Personal Information Collections
Information retrieval systems can be partitioned into two main classes: large-scale systems that make use of an inverted index or some other auxiliary data structure, intended for...
Owen de Kretser, Alistair Moffat
78
Voted
ESA
1998
Springer
169views Algorithms» more  ESA 1998»
15 years 1 months ago
Augmenting Suffix Trees, with Applications
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
Yossi Matias, S. Muthukrishnan, Süleyman Cenk...
FOCS
2000
IEEE
15 years 1 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
110
Voted
CIKM
2005
Springer
15 years 3 months ago
Rotation invariant indexing of shapes and line drawings
We present data representations, distance measures and organizational structures for fast and efficient retrieval of similar shapes in image databases. Using the Hough Transform w...
Michail Vlachos, Zografoula Vagena, Philip S. Yu, ...
CLA
2004
14 years 11 months ago
Concept Lattice Generation by Singular Value Decomposition
Abstract. Latent semantic indexing (LSI) is an application of numerical method called singular value decomposition (SVD), which discovers latent semantic in documents by creating c...
Petr Gajdos, Pavel Moravec, Václav Sn&aacut...