Sciweavers

677 search results - page 67 / 136
» Reducing the Space Requirement of LZ-Index
Sort
View
CIAC
2000
Springer
118views Algorithms» more  CIAC 2000»
15 years 2 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...
CIKM
1997
Springer
15 years 2 months ago
Block Addressing Indices for Approximate Text Retrieval
Although the issue of approximate text retrieval is gaining importance in the last years, it is currently addressed by only a few indexing schemes. To reduce space requirements, t...
Ricardo A. Baeza-Yates, Gonzalo Navarro
DAC
1996
ACM
15 years 2 months ago
Computing Parametric Yield Adaptively Using Local Linear Models
Abstract A divide-and-conquer algorithm for computing the parametric yield of large analog circuits is presented. The algorithm targets applications whose performance spreads could...
Mien Li, Linda S. Milor
DOCENG
2007
ACM
15 years 1 months ago
A document object modeling method to retrieve data from a very large XML document
Document Object Modeling (DOM) is widely used approach for retrieving data from an XML document. If the size of the XML document is very large, however, using the DOM approach for...
Seung Min Kim, Suk I. Yoo, Eunji Hong, Tae Gwon Ki...
EDCC
2006
Springer
15 years 1 months ago
Construction of a Highly Dependable Operating System
It has been well established that most operating system crashes are due to bugs in device drivers. Because drivers are normally linked into the kernel address space, a buggy drive...
Jorrit N. Herder, Herbert Bos, Ben Gras, Philip Ho...