Sciweavers

2463 search results - page 17 / 493
» Compressing Pattern Databases
Sort
View
EDBT
2008
ACM
177views Database» more  EDBT 2008»
14 years 7 months ago
Fast computing reachability labelings for large graphs with high compression rate
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
ET
2002
77views more  ET 2002»
13 years 7 months ago
Reusing Scan Chains for Test Pattern Decompression
The paper presents a method for testing a system-on-achip by using a compressed representation of the patterns on an external tester. The patterns for a certain core under test ar...
Rainer Dorsch, Hans-Joachim Wunderlich
WWW
2007
ACM
14 years 8 months ago
Using d-gap patterns for index compression
Sequential patterns of d-gaps exist pervasively in inverted lists of Web document collection indices due to the cluster property. In this paper the information of d-gap sequential...
Jinlin Chen, Terry Cook
CSB
2004
IEEE
177views Bioinformatics» more  CSB 2004»
13 years 11 months ago
Compressed Pattern Matching in DNA Sequences
We propose derivative Boyer-Moore (d-BM), a new compressed pattern matching algorithm in DNA sequences. This algorithm is based on the BoyerMoore method, which is one of the most ...
Lei Chen, Shiyong Lu, Jeffrey L. Ram
CPM
2000
Springer
143views Combinatorics» more  CPM 2000»
13 years 12 months ago
A Boyer-Moore Type Algorithm for Compressed Pattern Matching
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda...