Sciweavers

677 search results - page 43 / 136
» On the reconstruction of perfect codes
Sort
View
79
Voted
SIAMSC
2010
215views more  SIAMSC 2010»
14 years 8 months ago
A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
We propose a fast algorithm for solving the ℓ1-regularized minimization problem minx∈Rn µ x 1 + Ax − b 2 2 for recovering sparse solutions to an undetermined system of linea...
Zaiwen Wen, Wotao Yin, Donald Goldfarb, Yin Zhang
ISHPC
2003
Springer
15 years 2 months ago
Code and Data Transformations for Improving Shared Cache Performance on SMT Processors
Simultaneous multithreaded processors use shared on-chip caches, which yield better cost-performance ratios. Sharing a cache between simultaneously executing threads causes excessi...
Dimitrios S. Nikolopoulos
CORR
2008
Springer
197views Education» more  CORR 2008»
14 years 9 months ago
Sequential adaptive compressed sampling via Huffman codes
In this paper we introduce an information theoretic approach and use techniques from the theory of Huffman codes to construct a sequence of binary sampling vectors to determine a s...
Akram Aldroubi, Haichao Wang, Kourosh Zarringhalam
CVPR
2011
IEEE
14 years 5 months ago
Online Detection of Unusual Events in Videos via Dynamic Sparse Coding
Real-time unusual event detection in video stream has been a difficult challenge due to the lack of sufficient training information, volatility of the definitions for both norm...
Bin Zhao, Li Fei-Fei, Eric Xing
ICIP
2004
IEEE
15 years 11 months ago
Optimal per-pixel estimation for scalable video coding
We address the problem of real-time mode decisions for enhancement layer coding in the context of fine granularity scalable coding. While traditional mode selection strategies tak...
Athanasios Leontaris, Pamela C. Cosman