Sciweavers

18 search results - page 2 / 4
» Index Compression Using Fixed Binary Codewords
Sort
View
ICASSP
2011
IEEE
12 years 9 months ago
The value of redundant measurement in compressed sensing
The aim of compressed sensing is to recover attributes of sparse signals using very few measurements. Given an overall bit budget for quantization, this paper demonstrates that th...
Victoria Kostina, Marco F. Duarte, Sina Jafarpour,...
DCC
2006
IEEE
14 years 4 months ago
Making the Correct Mistakes
We propose a new sequential, adaptive, quadratic-time algorithm for variable-rate lossy compression of memoryless sources at a fixed distortion. The algorithm uses approximate pat...
Dharmendra S. Modha, Narayana P. Santhanam
TIT
2008
102views more  TIT 2008»
13 years 5 months ago
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
Jie Luo
SIGMOD
2009
ACM
213views Database» more  SIGMOD 2009»
14 years 5 months ago
Dictionary-based order-preserving string compression for main memory column stores
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...
Carsten Binnig, Stefan Hildenbrand, Franz Fär...
USENIX
1993
13 years 6 months ago
Essence: A Resource Discovery System Based on Semantic File Indexing
Discovering different types of file resources (such as documentation, programs, and images) in the vast amount of data contained within network file systems is useful for both u...
Darren R. Hardy, Michael F. Schwartz