Sciweavers

4553 search results - page 492 / 911
» Distributed Ranked Search
Sort
View
NPC
2004
Springer
15 years 10 months ago
Lookup-Ring: Building Efficient Lookups for High Dynamic Peer-to-Peer Overlays
This paper is motivated by the problem of poor searching efficiency in decentralized peer-to-peer file-sharing systems. We solve the searching problem by considering and modeling t...
Xuezheng Liu, Guangwen Yang, Jinfeng Hu, Ming Chen...
INFOCOM
2003
IEEE
15 years 10 months ago
YAPPERS: A Peer-to-Peer Lookup Service over Arbitrary Topology
— Existing peer-to-peer search networks generally fall into two categories: Gnutella-style systems that use arbitrary topology and rely on controlled flooding for search, and sy...
Prasanna Ganesan, Qixiang Sun, Hector Garcia-Molin...
JODL
2000
201views more  JODL 2000»
15 years 4 months ago
A transaction log analysis of a digital library
As experimental digital library testbeds gain wider acceptance and develop significant user bases, it becomes important to investigate the ways in which users interact with the sy...
Steve Jones, Sally Jo Cunningham, Rodger J. McNab,...
WWW
2005
ACM
16 years 5 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...
RSCTC
2000
Springer
146views Fuzzy Logic» more  RSCTC 2000»
15 years 8 months ago
Application of Discernibility Tables to Calculation of Approximate Frequency Based Reducts
Abstract. We provide the unified methodology for searching for approximate decision reducts based on rough membership distributions. Presented study generalizes well known relation...
Maciej Borkowski, Dominik Slezak