Sciweavers

148 search results - page 10 / 30
» Optimizing random walk search algorithms in P2P networks
Sort
View
INFOSCALE
2007
ACM
15 years 1 months ago
A distributed incremental nearest neighbor algorithm
Searching for non-text data (e.g., images) is mostly done by means of metadata annotations or by extracting the text close to the data. However, supporting real content-based audi...
Fabrizio Falchi, Claudio Gennaro, Fausto Rabitti, ...
MIDDLEWARE
2005
Springer
15 years 5 months ago
An Optimal Overlay Topology for Routing Peer-to-Peer Searches
Unstructured peer-to-peer networks are frequently used as the overlay in various middleware toolkits for emerging applications, from content discovery to query result caching to di...
Brian F. Cooper
INFOCOM
2005
IEEE
15 years 5 months ago
Hybrid search schemes for unstructured peer-to-peer networks
— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes comb...
Christos Gkantsidis, Milena Mihail, Amin Saberi
SIGMOD
2004
ACM
153views Database» more  SIGMOD 2004»
15 years 5 months ago
Spatially-decaying aggregation over a network: model and algorithms
Data items are often associated with a location in which they are present or collected, and their relevance or in uence decays with their distance. Aggregate values over such data...
Edith Cohen, Haim Kaplan