Sciweavers

868 search results - page 3 / 174
» A general compression algorithm that supports fast searching
Sort
View
ICASSP
2011
IEEE
12 years 10 months ago
Audio Signal Representations for Factorization in the Sparse Domain
In this paper, a new class of audio representations is introduced, together with a corresponding fast decomposition algorithm. The main feature of these representations is that th...
Manuel Moussallam, Laurent Daudet, Gaël Richa...
ICIP
2000
IEEE
14 years 7 months ago
Fast Code Enhancement with Local Search for Fractal Image Compression
Optimal fractal coding consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Optimal fractal coding is ...
Raouf Hamzaoui, Dietmar Saupe, Michael Hiller
CIKM
2007
Springer
14 years 12 days ago
Sigma encoded inverted files
Compression of term frequency lists and very long document-id lists within an inverted file search engine are examined. Several compression schemes are compared including Elias γ...
Andrew Trotman, Vikram Subramanya
SPIRE
1998
Springer
13 years 10 months ago
Direct Pattern Matching on Compressed Text
We present a fast compression and decompression technique for natural language texts. The novelty is that the exact search can be done on the compressed text directly, using any k...
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
ALENEX
2008
192views Algorithms» more  ALENEX 2008»
13 years 7 months ago
Compressed Inverted Indexes for In-Memory Search Engines
We present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system ...
Frederik Transier, Peter Sanders