1193 search results - page 125 / 239 » A primer of simple theories |
215
click to vote
TSP
2010
15 years 1 months ago
2010
We present two simple methods for recovering sparse signals from a series of noisy observations. The theory of compressed sensing (CS) requires solving a convex constrained minimiz...
174
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
Abstract—Recently, it has been shown that a simple, distributed CSMA algorithm is throughput-optimal. However, throughput-optimality is established under the perfect or ideal car...
331
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
Several recent works considered cooperative cleaning in static and dynamic environments, which incorporates a swarm of simple robots cleaning an expanding region of contaminated c...
215
click to vote
COMGEO
2012
ACM
14 years 2 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
200
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We demonstrate that a single convex program gives an accurate estim...