Sciweavers

266 search results - page 45 / 54
» On first-order topological queries
Sort
View
MSWIM
2006
ACM
14 years 1 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
P2P
2005
IEEE
119views Communications» more  P2P 2005»
14 years 1 months ago
Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks
Search is a fundamental service in peer-to-peer (P2P) networks. However, despite numerous research efforts, efficient algorithms for guaranteed location of shared content in unst...
Ronaldo A. Ferreira, Murali Krishna Ramanathan, As...
SIGCOMM
2005
ACM
14 years 1 months ago
Meridian: a lightweight network location service without virtual coordinates
This paper introduces a lightweight, scalable and accurate framework, called Meridian, for performing node selection based on network location. The framework consists of an overla...
Bernard Wong, Aleksandrs Slivkins, Emin Gün S...
CIKM
2005
Springer
14 years 1 months ago
Web-centric language models
We investigates language models for informational and navigational web search. Retrieval on the web is a task that differs substantially from ordinary ad hoc retrieval. We perfor...
Jaap Kamps
IPSN
2005
Springer
14 years 1 months ago
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu