Sciweavers

110 search results - page 22 / 22
» Recovery of (Non)Monotonic Theories
Sort
View
IMC
2007
ACM
13 years 6 months ago
Learning network structure from passive measurements
The ability to discover network organization, whether in the form of explicit topology reconstruction or as embeddings that approximate topological distance, is a valuable tool. T...
Brian Eriksson, Paul Barford, Robert Nowak, Mark C...
NIPS
2008
13 years 6 months ago
Natural Image Denoising with Convolutional Networks
We present an approach to low-level vision that combines two main ideas: the use of convolutional networks as an image processing architecture and an unsupervised learning procedu...
Viren Jain, H. Sebastian Seung
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 4 months ago
Phase Transitions for Greedy Sparse Approximation Algorithms
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...
TCSV
2008
156views more  TCSV 2008»
13 years 4 months ago
Robust Lossless Image Data Hiding Designed for Semi-Fragile Image Authentication
Recently, among various data hiding techniques, a new subset, lossless data hiding, has received increasing interest. Most of the existing lossless data hiding algorithms are, howe...
Zhicheng Ni, Yun Q. Shi, Nirwan Ansari, Wei Su, Qi...
P2P
2010
IEEE
207views Communications» more  P2P 2010»
13 years 3 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