Sciweavers

244 search results - page 40 / 49
» Analyzing the performance of randomized information sharing
Sort
View
WWW
2005
ACM
14 years 8 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
ISPAN
2005
IEEE
14 years 1 months ago
Supervised Peer-to-Peer Systems
In this paper we present a general methodology for designing supervised peer-to-peer systems. A supervised peer-to-peer system is a system in which the overlay network is formed b...
Kishore Kothapalli, Christian Scheideler
KDD
2010
ACM
259views Data Mining» more  KDD 2010»
13 years 11 months ago
A probabilistic model for personalized tag prediction
Social tagging systems have become increasingly popular for sharing and organizing web resources. Tag recommendation is a common feature of social tagging systems. Social tagging ...
Dawei Yin, Zhenzhen Xue, Liangjie Hong, Brian D. D...
SAICSIT
2010
ACM
13 years 5 months ago
Determining requirements within an indigenous knowledge system of African rural communities
Eliciting and analyzing requirements within knowledge systems, which fundamentally differ so far from technology supported systems represent particular challenges. African rural c...
Heike Winschiers-Theophilus, Nicola J. Bidwell, Sh...
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 7 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li