511 search results - page 17 / 103 » Lower bounds for distributed markov chain problems |
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—We analyze how node mobility can influence the convergence time of averaging gossip algorithms on networks. Our main result is that even a small number of fully mobile nodes ca...
CAV
2007
Springer
14 years 2 months ago
2007
Springer
ng-Lens Abstraction for Markov Decision Processes⋆ In Proc. of CAV 2007: 19th International Conference on Computer-Aided Verification, Lectures Notes in Computer Science. c Spri...
COLT
2006
Springer
13 years 11 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM-based) wireless downlink systems. We show that the Server-Side Greedy (SSG) rul...
ICCV
2005
IEEE
14 years 10 months ago
2005
IEEE
This paper breaks with the common practice of using a joint state space representation and performing the joint data association in multi-object tracking. Instead, we present an i...