Sciweavers

950 search results - page 164 / 190
» Evaluation over thousands of queries
Sort
View
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
11 years 11 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
GIS
2006
ACM
14 years 10 months ago
Filtering with raster signatures
Efficient evaluation of spatial queries is an important issue in spatial database. Among spatial operations, spatial join is very useful, intersection being the most common predic...
Leonardo Guerreiro Azevedo, Ralf Hartmut Güti...
HPDC
2003
IEEE
14 years 2 months ago
Distributed Pagerank for P2P Systems
This paper defines and describes a fully distributed implementation of Google’s highly effective Pagerank algorithm, for “peer to peer”(P2P) systems. The implementation is ...
Karthikeyan Sankaralingam, Simha Sethumadhavan, Ja...
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
14 years 3 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
P2P
2007
IEEE
153views Communications» more  P2P 2007»
14 years 3 months ago
On Routing in Distributed Hash Tables
There have been many proposals for constructing routing tables for Distributed Hash Tables (DHT). They can be classified into two groups: A) those that assume that the peers are ...
Fabius Klemm, Sarunas Girdzijauskas, Jean-Yves Le ...