Sciweavers

110 search results - page 4 / 22
» Recovery of (Non)Monotonic Theories
Sort
View
ICASSP
2008
IEEE
14 years 1 months ago
Insights into the stable recovery of sparse solutions in overcomplete representations using network information theory
In this paper, we examine the problem of overcomplete representations and provide new insights into the problem of stable recovery of sparse solutions in noisy environments. We es...
Yuzhe Jin, Bhaskar D. Rao
COMPGEOM
2011
ACM
12 years 11 months ago
Compressive sensing with local geometric features
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachli...
ESORICS
2004
Springer
14 years 22 days ago
Towards a Theory of Data Entanglement: (Extended Abstract)
d Abstract) James Aspnes , Joan Feigenbaum , Aleksandr Yampolskiy † , and Sheng Zhong ‡ Department of Computer Science, Yale University, New Haven CT 06520-8285, USA Abstract. ...
James Aspnes, Joan Feigenbaum, Aleksandr Yampolski...
DC
2002
13 years 7 months ago
Restoration by path concatenation: fast recovery of MPLS paths
A new general theory about restoration of network paths is first introduced. The theory pertains to restoration of shortest paths in a network following failure, e.g., we prove th...
Yehuda Afek, Anat Bremler-Barr, Haim Kaplan, Edith...
GLVLSI
2005
IEEE
67views VLSI» more  GLVLSI 2005»
14 years 29 days ago
Energy recovery clocked dynamic logic
Energy recovery clocking results in significant energy savings in clock distribution networks as compared to conventional squarewave clocking. However, since energy recovery clock...
Matthew Cooke, Hamid Mahmoodi-Meimand, Qikai Chen,...