Sciweavers

2092 search results - page 279 / 419
» Dynamically Distributed Query Evaluation
Sort
View
122
Voted
CONEXT
2007
ACM
15 years 6 months ago
On the cost of caching locator/ID mappings
Very recent activities in the IETF and in the Routing Research Group (RRG) of the IRTG focus on defining a new Internet architecture, in order to solve scalability issues related ...
Luigi Iannone, Olivier Bonaventure
121
Voted
CIVR
2007
Springer
155views Image Analysis» more  CIVR 2007»
15 years 8 months ago
Detection of near-duplicate images for web search
Among the vast numbers of images on the web are many duplicates and near-duplicates, that is, variants derived from the same original image. Such near-duplicates appear in many we...
Jun Jie Foo, Justin Zobel, Ranjan Sinha, Seyed M. ...
WWW
2005
ACM
16 years 3 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...
121
Voted
SIGMOD
2004
ACM
150views Database» more  SIGMOD 2004»
16 years 2 months ago
When one Sample is not Enough: Improving Text Database Selection Using Shrinkage
Database selection is an important step when searching over large numbers of distributed text databases. The database selection task relies on statistical summaries of the databas...
Panagiotis G. Ipeirotis, Luis Gravano
132
Voted
ICSNW
2004
Springer
188views Database» more  ICSNW 2004»
15 years 8 months ago
Peer Selection in Peer-to-Peer Networks with Semantic Topologies
Peer-to-Peer systems have proven to be an effective way of sharing data. Modern protocols are able to efficiently route a message to a given peer. However, determining the destin...
Peter Haase, Ronny Siebes, Frank van Harmelen