Sciweavers

338 search results - page 31 / 68
» Fast distributed random walks
Sort
View
GCC
2003
Springer
15 years 2 months ago
Dominating-Set-Based Searching in Peer-to-Peer Networks
— The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the...
Chunlin Yang, Jie Wu
FOCS
1994
IEEE
15 years 1 months ago
The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs
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...
Michael A. Bender, Donna K. Slonim
SIGMETRICS
2008
ACM
131views Hardware» more  SIGMETRICS 2008»
14 years 9 months ago
On the design of hybrid peer-to-peer systems
In this paper, we consider hybrid peer-to-peer systems where users form an unstructured peer-to-peer network with the purpose of assisting a server in the distribution of data. We...
Stratis Ioannidis, Peter Marbach
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...