2324 search results - page 150 / 465 » A Fast Keyword-Spotting Technique |
192
click to vote
SMA
2003
ACM
16 years 2 days ago
2003
ACM
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
177
click to vote
SIGIR
1998
ACM
15 years 11 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
167
click to vote
DCC
2010
IEEE
15 years 10 months ago
2010
IEEE
This paper improves the Tagged Suboptimal Codes (TSC) compression scheme in several ways. We show how to process the TSC as a universal code. We introduce the TSCk as a family of ...
270
click to vote
SIGMOD
2006
ACM
16 years 7 months ago
2006
ACM
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
179
click to vote
EDBT
2006
ACM
16 years 7 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...