Sciweavers

67 search results - page 6 / 14
» Compressed Data Structures: Dictionaries and Data-Aware Meas...
Sort
View
CASES
2006
ACM
14 years 1 months ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson
MSV
2004
13 years 8 months ago
S(b)-Trees: An Optimal Balancing of Variable Length Keys
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
Konstantin V. Shvachko
ICASSP
2011
IEEE
12 years 11 months ago
Cosparse analysis modeling - uniqueness and algorithms
In the past decade there has been a great interest in a synthesis-based model for signals, based on sparse and redundant representations. Such a model assumes that the signal of i...
Sangnam Nam, Michael E. Davies, Michael Elad, R&ea...
KDD
2009
ACM
185views Data Mining» more  KDD 2009»
14 years 8 months ago
On compressing social networks
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, ...
BMCBI
2007
128views more  BMCBI 2007»
13 years 7 months ago
Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assess
Background: Similarity of sequences is a key mathematical notion for Classification and Phylogenetic studies in Biology. It is currently primarily handled using alignments. Howeve...
Paolo Ferragina, Raffaele Giancarlo, Valentina Gre...