Sciweavers

574 search results - page 88 / 115
» Sequential Compressed Sensing
Sort
View
JMLR
2012
11 years 10 months ago
Detecting Network Cliques with Radon Basis Pursuit
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between o...
Xiaoye Jiang, Yuan Yao, Han Liu, Leonidas J. Guiba...
IROS
2009
IEEE
156views Robotics» more  IROS 2009»
14 years 2 months ago
Nonparametric belief propagation for distributed tracking of robot networks with noisy inter-distance measurements
— We consider the problem of tracking multiple moving robots using noisy sensing of inter-robot and interbeacon distances. Sensing is local: there are three fixed beacons at kno...
Jeremy Schiff, Erik B. Sudderth, Kenneth Y. Goldbe...
GI
2010
Springer
13 years 5 months ago
Finite System Composition and Interaction
: In this article, it is proven for finite systems that if by reciprocal interaction, one finite system determines the action of another finite system, then both systems become sub...
Johannes Reich
TIT
1998
90views more  TIT 1998»
13 years 7 months ago
Source Codes as Random Number Generators
—A random number generator generates fair coin flips by processing deterministically an arbitrary source of nonideal randomness. An optimal random number generator generates asy...
Karthik Visweswariah, Sanjeev R. Kulkarni, Sergio ...
JMLR
2012
11 years 10 months ago
Universal Measurement Bounds for Structured Sparse Signal Recovery
Standard compressive sensing results state that to exactly recover an s sparse signal in Rp , one requires O(s · log p) measurements. While this bound is extremely useful in prac...
Nikhil S. Rao, Ben Recht, Robert D. Nowak