Sciweavers

138 search results - page 13 / 28
» Graph Laplacians and their convergence on random neighborhoo...
Sort
View
CDC
2008
IEEE
144views Control Systems» more  CDC 2008»
14 years 2 months ago
On the convergence time of distributed quantized averaging algorithms
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
Minghui Zhu, Sonia Martínez
TON
2010
126views more  TON 2010»
13 years 2 months ago
MAC Scheduling With Low Overheads by Learning Neighborhood Contention Patterns
Aggregate traffic loads and topology in multi-hop wireless networks may vary slowly, permitting MAC protocols to `learn' how to spatially coordinate and adapt contention patte...
Yung Yi, Gustavo de Veciana, Sanjay Shakkottai
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
13 years 11 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
PAMI
2007
196views more  PAMI 2007»
13 years 7 months ago
Clustering and Embedding Using Commute Times
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...
Huaijun Qiu, Edwin R. Hancock
ECCV
2006
Springer
14 years 9 months ago
Robust Multi-body Motion Tracking Using Commute Time Clustering
Abstract. The presence of noise renders the classical factorization method almost impractical for real-world multi-body motion tracking problems. The main problem stems from the ef...
Huaijun Qiu, Edwin R. Hancock