Sciweavers

733 search results - page 77 / 147
» Recommending random walks
Sort
View
COMGEO
2004
ACM
14 years 9 months ago
Expected time analysis for Delaunay point location
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...
Luc Devroye, Christophe Lemaire, Jean-Michel Morea...
RAID
2010
Springer
14 years 8 months ago
Anomaly Detection and Mitigation for Disaster Area Networks
Abstract. One of the most challenging applications of wireless networking are in disaster area networks where lack of infrastructure, limited energy resources, need for common oper...
Jordi Cucurull, Mikael Asplund, Simin Nadjm-Tehran...
GLOBECOM
2010
IEEE
14 years 7 months ago
Compressive Data Persistence in Large-Scale Wireless Sensor Networks
This paper considers a large-scale wireless sensor network where sensor readings are occasionally collected by a mobile sink, and sensor nodes are responsible for temporarily stori...
Mu Lin, Chong Luo, Feng Liu, Feng Wu
IMC
2010
ACM
14 years 7 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
CORR
2011
Springer
136views Education» more  CORR 2011»
14 years 4 months ago
Degree Fluctuations and the Convergence Time of Consensus Algorithms
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the deg...
Alexander Olshevsky, John N. Tsitsiklis