Sciweavers

70 search results - page 8 / 14
» On the connectivity of dynamic random geometric graphs
Sort
View
TMC
2011
131views more  TMC 2011»
14 years 4 months ago
In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
Srikanth K. Iyer, D. Manjunath, R. Sundaresan
INFOCOM
2007
IEEE
15 years 4 months ago
Robust Geo-Routing on Embeddings of Dynamic Wireless Networks
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...
Dominique Tschopp, Suhas N. Diggavi, Matthias Gros...
TON
2008
106views more  TON 2008»
14 years 9 months ago
On static and dynamic partitioning behavior of large-scale P2P networks
Abstract--In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node fail...
Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri...
CVPR
2004
IEEE
15 years 1 months ago
Modeling Complex Motion by Tracking and Editing Hidden Markov Graphs
In this paper, we propose a generative model for representing complex motion, such as wavy river, dancing fire and dangling cloth. Our generative method consists of four component...
Yizhou Wang, Song Chun Zhu
CORR
2010
Springer
79views Education» more  CORR 2010»
14 years 9 months ago
Random Topologies and the emergence of cooperation: the role of short-cuts
We present a detailed study about the role of the short-cuts of a network in promoting the emergence of cooperation in a population of agents playing the Prisoner's Dilemma Ga...
Daniele Vilone, Angel Sánchez, Jesús...