Sciweavers

227 search results - page 43 / 46
» Approximation of the Quadratic Set Covering problem
Sort
View
78
Voted
ICC
2007
IEEE
203views Communications» more  ICC 2007»
15 years 3 months ago
Distributed Data Aggregation Using Clustered Slepian-Wolf Coding in Wireless Sensor Networks
—Slepian-Wolf coding is a promising distributed source coding technique that can completely remove the data redundancy caused by the spatially correlated observations in wireless...
Pu Wang, Cheng Li, Jun Zheng
PODC
2005
ACM
15 years 3 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
SIAMIS
2008
174views more  SIAMIS 2008»
14 years 9 months ago
Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
We consider the restoration of piecewise constant images where the number of the regions and their values are not fixed in advance, with a good difference of piecewise constant val...
Mila Nikolova, Michael K. Ng, Shuqin Zhang, Wai-Ki...
FOCS
2004
IEEE
15 years 1 months ago
Worst-Case to Average-Case Reductions Based on Gaussian Measures
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
Daniele Micciancio, Oded Regev
ICPR
2000
IEEE
15 years 10 months ago
General Bias/Variance Decomposition with Target Independent Variance of Error Functions Derived from the Exponential Family of D
An important theoretical tool in machine learning is the bias/variance decomposition of the generalization error. It was introduced for the mean square error in [3]. The bias/vari...
Jakob Vogdrup Hansen, Tom Heskes