Sciweavers

273 search results - page 9 / 55
» Compressed String Dictionaries
Sort
View
DCC
2008
IEEE
14 years 7 months ago
Compressed Index for Dictionary Matching
Wing-Kai Hon, Tak Wah Lam, Rahul Shah, Siu-Lung Ta...
ICASSP
2009
IEEE
14 years 2 months ago
Sparse Decomposition over non-full-rank dictionaries
Sparse Decomposition (SD) of a signal on an overcomplete dictionary has recently attracted a lot of interest in signal processing and statistics, because of its potential applicat...
Massoud Babaie-Zadeh, Vincent Vigneron, Christian ...
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
14 years 1 months ago
On Pseudoentropy versus Compressibility
A source is compressible if we can efficiently compute short descriptions of strings in the support and efficiently recover the strings from the descriptions. A source has high ps...
Hoeteck Wee
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng
CPM
2010
Springer
146views Combinatorics» more  CPM 2010»
14 years 15 days ago
Parallel and Distributed Compressed Indexes
Abstract. We study parallel and distributed compressed indexes. Compressed indexes are a new and functional way to index text strings. They exploit the compressibility of the text,...
Luís M. S. Russo, Gonzalo Navarro, Arlindo ...