180 search results - page 23 / 36 » Approximate Searching on Compressed Text |
82
Voted
SPIRE
2001
Springer
15 years 5 months ago
2001
Springer
Most queries to text search engines are ranked or Boolean. Phrase querying is a powerful technique for refining searches, but is expensive to implement on conventional indexes. I...
75
Voted
ECIR
2004
Springer
15 years 2 months ago
2004
Springer
This paper introduces a new approach to add fault-tolerance to a fulltext retrieval system. The weighted pattern morphing technique circumvents some of the disadvantages of the wid...
131
Voted
DASFAA
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract. Recently, we have proposed a novel method for the compression of time series based on mathematical models that explore dependencies between different time series. This r...
139
click to vote
COCO
2005
Springer
15 years 6 months ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
110
click to vote
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
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...