260 search results - page 50 / 52 » Dynamic Random Geometric Graphs |
102
click to vote
IEEESCC
2009
IEEE
14 years 7 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
93
Voted
CORR
2007
Springer
14 years 9 months ago
2007
Springer
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...
JCO
2006
14 years 9 months ago
2006
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Sparse representation in compressive sensing is gaining increasing attention due to its success in various applications. As we demonstrate in this paper, however, image sparse rep...
ARCS
2005
Springer
15 years 3 months ago
2005
Springer
We propose an active vision system for object acquisition. The core of our approach is a reinforcement learning module which learns a strategy to scan an object. The agent moves a...