Sciweavers

119 search results - page 18 / 24
» A Theory of Redo Recovery
Sort
View
CORR
2010
Springer
116views Education» more  CORR 2010»
14 years 9 months ago
Restricted Isometries for Partial Random Circulant Matrices
In the theory of compressed sensing, restricted isometry analysis has become a standard tool for studying how efficiently a measurement matrix acquires information about sparse an...
Holger Rauhut, Justin K. Romberg, Joel A. Tropp
P2P
2010
IEEE
207views Communications» more  P2P 2010»
14 years 8 months ago
Local Access to Sparse and Large Global Information in P2P Networks: A Case for Compressive Sensing
—In this paper we face the following problem: how to provide each peer local access to the full information (not just a summary) that is distributed over all edges of an overlay ...
Rossano Gaeta, Marco Grangetto, Matteo Sereno
ANCS
2009
ACM
14 years 7 months ago
Design and performance analysis of a DRAM-based statistics counter array architecture
The problem of maintaining efficiently a large number (say millions) of statistics counters that need to be updated at very high speeds (e.g. 40 Gb/s) has received considerable re...
Haiquan (Chuck) Zhao, Hao Wang, Bill Lin, Jun (Jim...
JSCIC
2010
136views more  JSCIC 2010»
14 years 4 months ago
Multiple Level Sets for Piecewise Constant Surface Reconstruction in Highly Ill-Posed Problems
This paper considers highly ill-posed surface recovery inverse problems, where the sought surface in 2D or 3D is piecewise constant with several possible level values. These level...
K. van den Doel, U. M. Ascher, A. Leitão
CORR
2011
Springer
144views Education» more  CORR 2011»
14 years 1 months ago
Rank Aggregation via Nuclear Norm Minimization
The process of rank aggregation is intimately intertwined with the structure of skew-symmetric matrices. We apply recent advances in the theory and algorithms of matrix completion...
David F. Gleich, Lek-Heng Lim