18 search results - page 2 / 4 » Compressed Text Indexes with Fast Locate |
DCC
2010
IEEE
14 years 4 months ago
2010
IEEE
We introduce an alternative Lempel-Ziv text parsing, LZ-End, that converges to the entropy and in practice gets very close to LZ77. LZ-End forces sources to finish at the end of ...
CVPR
2009
IEEE
15 years 4 months ago
2009
IEEE
Efficient view registration with respect to a given 3D reconstruction
has many applications like inside-out tracking
in indoor and outdoor environments, and geo-locating images
...
ICDE
1998
IEEE
14 years 2 months ago
1998
IEEE
We propose a new compression algorithm that is tailored to database applications. It can be applied to a collection of records, and is especially e ective for records with many lo...
SIGIR
2006
ACM
14 years 3 months ago
2006
ACM
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
IR
2008
13 years 9 months ago
2008
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...