73 search results - page 3 / 15 » Random Walk on Directed Dynamic Graphs |
FOCS
1994
IEEE
13 years 10 months ago
1994
IEEE
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
COMBINATORICS
2006
13 years 5 months ago
2006
For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly con...
VTC
2006
IEEE
13 years 11 months ago
2006
IEEE
— Mobility models are widely used in simulation-based performance analyses of mobile networks. However, there is a trade-off between simplicity and realistic movement patterns. S...
ACCV
2009
Springer
14 years 12 days ago
2009
Springer
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
INFOCOM
2010
IEEE
13 years 4 months ago
2010
IEEE
—In this paper we develop a unified theoretical framework for estimating various transmission costs of packet forwarding in wireless networks. Our framework can be applied to th...