Sciweavers

5 search results - page 1 / 1
» Make it fresh, make it quick: searching a network of persona...
Sort
View
WWW
2003
ACM
13 years 10 months ago
Make it fresh, make it quick: searching a network of personal webservers
Personal webservers have proven to be a popular means of sharing files and peer collaboration. Unfortunately, the transient availability and rapidly evolving content on such host...
Mayank Bawa, Roberto J. Bayardo Jr., Sridhar Rajag...
SIGMOD
2010
ACM
232views Database» more  SIGMOD 2010»
13 years 5 months ago
Optimizing content freshness of relations extracted from the web using keyword search
An increasing number of applications operate on data obtained from the Web. These applications typically maintain local copies of the web data to avoid network latency in data acc...
Mohan Yang, Haixun Wang, Lipyeow Lim, Min Wang
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
12 years 7 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
MOBISYS
2008
ACM
14 years 4 months ago
Efficient channel-aware rate adaptation in dynamic environments
Increasingly, 802.11 devices are being used by mobile users. This results in very dynamic wireless channels that are difficult to use efficiently. Current rate selection algorithm...
Glenn Judd, Xiaohui Wang, Peter Steenkiste
ATAL
2003
Springer
13 years 10 months ago
A method for decentralized clustering in large multi-agent systems
This paper examines a method of clustering within a fully decentralized multi-agent system. Our goal is to group agents with similar objectives or data, as is done in traditional ...
Elth Ogston, Benno J. Overeinder, Maarten van Stee...