Sciweavers

51 search results - page 8 / 11
» Alphabet-Independent Compressed Text Indexing
Sort
View
SIGIR
2011
ACM
14 years 9 days ago
Faster temporal range queries over versioned text
Versioned textual collections are collections that retain multiple versions of a document as it evolves over time. Important large-scale examples are Wikipedia and the web collect...
Jinru He, Torsten Suel
CIKM
2008
Springer
14 years 11 months ago
TinyLex: static n-gram index pruning with perfect recall
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
Derrick Coetzee
106
Voted
CPM
2005
Springer
101views Combinatorics» more  CPM 2005»
15 years 3 months ago
Succinct Suffix Arrays Based on Run-Length Encoding
A succinct full-text self-index is a data structure built on a text T = t1t2 . . . tn, which takes little space (ideally close to that of the compressed text), permits efficient se...
Veli Mäkinen, Gonzalo Navarro
ICMCS
2005
IEEE
152views Multimedia» more  ICMCS 2005»
15 years 3 months ago
Pre-Attentional Filtering in Compressed Video
We propose the use of attentional cascades based on the DCT and motion information contained in an MPEG coded stream. An attentional cascade is a sequence of very efficient class...
Juan María Sánchez, Ramon Lluis Feli...
91
Voted
CCP
2011
92views more  CCP 2011»
13 years 9 months ago
Backwards Search in Context Bound Text Transformations
—The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the abili...
Matthias Petri, Gonzalo Navarro, J. Shane Culpeppe...