Sciweavers

662 search results - page 93 / 133
» Cheap and Fast - But is it Good
Sort
View
CIAC
2000
Springer
118views Algorithms» more  CIAC 2000»
13 years 12 months ago
Speeding Up Pattern Matching by Text Compression
Abstract. Byte pair encoding (BPE) is a simple universal text compression scheme. Decompression is very fast and requires small work space. Moreover, it is easy to decompress an ar...
Yusuke Shibata, Takuya Kida, Shuichi Fukamachi, Ma...
SIGCSE
1999
ACM
193views Education» more  SIGCSE 1999»
13 years 12 months ago
Cache conscious programming in undergraduate computer science
The wide-spread use of microprocessor based systems that utilize cache memory to alleviate excessively long DRAM access times introduces a new dimension in the quest to obtain goo...
Alvin R. Lebeck
SIGIR
1999
ACM
13 years 12 months ago
Content-Based Retrieval Using Heuristic Search
The fast growth of multimedia information in image and video databases has triggered research on efficient retrieval methods. This paper deals with structural queries, a type of c...
Dimitris Papadias, Marios Mantzourogiannis, Panos ...
SIGMOD
1999
ACM
101views Database» more  SIGMOD 1999»
13 years 12 months ago
Join Synopses for Approximate Query Answering
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
Swarup Acharya, Phillip B. Gibbons, Viswanath Poos...
CPM
1999
Springer
107views Combinatorics» more  CPM 1999»
13 years 12 months ago
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...
Gonzalo Navarro, Mathieu Raffinot