Sciweavers

2883 search results - page 323 / 577
» Algorithms for merged indexes
Sort
View
JEA
2008
120views more  JEA 2008»
13 years 9 months ago
Better external memory suffix array construction
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in b...
Roman Dementiev, Juha Kärkkäinen, Jens M...
CSDA
2007
99views more  CSDA 2007»
13 years 9 months ago
CLUES: A non-parametric clustering method based on local shrinking
In this paper, we propose a novel non-parametric clustering method based on non-parametric local shrinking. Each data point is transformed in such a way that it moves a specific ...
Xiaogang Wang, Weiliang Qiu, Ruben H. Zamar
TCS
2008
13 years 9 months ago
On-line construction of compact suffix vectors and maximal repeats
A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear constru...
Élise Prieur, Thierry Lecroq
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
13 years 7 months ago
Efficient two-sided error-tolerant search
We consider fast two-sided error-tolerant search that is robust against errors both on the query side (type alogrithm, find documents with algorithm) as well as on the document si...
Hannah Bast, Marjan Celikik
ICIP
2009
IEEE
13 years 7 months ago
Best basis denoising with non-stationary wavelet packets
This article introduces a best basis search algorithm in a nonstationary (NS) wavelet packets dictionary. It computes an optimized labeled quad-tree that indexes the filters used ...
Nizar Ouarti, Gabriel Peyré