Sciweavers

1542 search results - page 130 / 309
» The metamathematics of random graphs
Sort
View
SAC
2002
ACM
15 years 1 months ago
A mobility and traffic generation framework for modeling and simulating ad hoc communication networks
We present a generic mobility and traffic generation framework that can be incorporated into a tool for modeling and simulating large scale ad hoc networks. Three components of thi...
Christopher L. Barrett, Madhav V. Marathe, James P...
TMM
2010
253views Management» more  TMM 2010»
14 years 8 months ago
Multi-View Video Summarization
Previous video summarization studies focused on monocular videos, and the results would not be good if they were applied to multi-view videos directly, due to problems such as the ...
Yanwei Fu, Yanwen Guo, Yanshu Zhu, Feng Liu, Chuan...
COMBINATORICA
2007
129views more  COMBINATORICA 2007»
15 years 1 months ago
Birth control for giants
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
Joel H. Spencer, Nicholas C. Wormald
DCOSS
2010
Springer
15 years 5 months ago
Fast Decentralized Averaging via Multi-scale Gossip
Abstract. We are interested in the problem of computing the average consensus in a distributed fashion on random geometric graphs. We describe a new algorithm called Multi-scale Go...
Konstantinos I. Tsianos, Michael G. Rabbat
MOBIHOC
2012
ACM
13 years 4 months ago
Spatial spectrum access game: nash equilibria and distributed learning
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
Xu Chen, Jianwei Huang