Sciweavers

273 search results - page 12 / 55
» Compressed String Dictionaries
Sort
View
CORR
2011
Springer
198views Education» more  CORR 2011»
13 years 2 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
Pawel Gawrychowski
CORR
2007
Springer
88views Education» more  CORR 2007»
13 years 7 months ago
Faster subsequence recognition in compressed strings
Abstract. Processing compressed strings without decompression is often essential when dealing with massive data sets. We consider local subsequence recognition problems on strings ...
Alexandre Tiskin
CPM
2010
Springer
175views Combinatorics» more  CPM 2010»
14 years 15 days ago
Compression, Indexing, and Retrieval for Massive String Data
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
WEA
2007
Springer
125views Algorithms» more  WEA 2007»
14 years 1 months ago
Simple Compression Code Supporting Random Access and Fast String Matching
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
Kimmo Fredriksson, Fedor Nikitin
FCCM
2007
IEEE
154views VLSI» more  FCCM 2007»
14 years 2 months ago
Code Compressor and Decompressor for Ultra Large Instruction Width Coarse-Grain Reconfigurable Systems
This paper presents a code compression and on-thefly decompression scheme suitable for coarse-grain reconfigurable technologies. A novel unit-grouping dictionary based compression...
Nazish Aslam, Mark Milward, Ioannis Nousias, Tughr...