Sciweavers

3116 search results - page 114 / 624
» Recovering
Sort
View
OPODIS
2010
13 years 7 months ago
Self-stabilizing (k, r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths
Abstract. Wireless Ad-hoc networks are distributed systems that often reside in error-prone environments. Self-stabilization lets the system recover autonomously from an arbitrary ...
Andreas Larsson, Philippas Tsigas
ICIP
2009
IEEE
13 years 6 months ago
Non-parametric natural image matting
Natural image matting is an extremely challenging image processing problem due to its ill-posed nature. It often requires skilled user interaction to aid definition of foreground ...
Muhammad Sarim, Adrian Hilton, Jean-Yves Guillemau...
ICMLA
2009
13 years 6 months ago
Exact Graph Structure Estimation with Degree Priors
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. T...
Bert Huang, Tony Jebara
CORR
2010
Springer
167views Education» more  CORR 2010»
13 years 6 months ago
Compressive Sensing over Graphs
In this paper, motivated by network inference and tomography applications, we study the problem of compressive sensing for sparse signal vectors over graphs. In particular, we are ...
Weiyu Xu, Enrique Mallada, Ao Tang
CORR
2010
Springer
97views Education» more  CORR 2010»
13 years 6 months ago
On the Scaling Law for Compressive Sensing and its Applications
1 minimization can be used to recover sufficiently sparse unknown signals from compressed linear measurements. In fact, exact thresholds on the sparsity, as a function of the ratio...
Weiyu Xu, Ao Tang