Sciweavers

37 search results - page 5 / 8
» Surrogate Ranking for Very Expensive Similarity Queries
Sort
View
126
Voted
AP2PC
2004
Springer
15 years 7 months ago
Semantic Overlay Networks for P2P Systems
In a peer-to-peer (P2P) system, nodes typically connect to a small set of random nodes (their neighbors), and queries are propagated along these connections. Such query flooding t...
Arturo Crespo, Hector Garcia-Molina
229
Voted
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
16 years 3 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
122
Voted
VLDB
2004
ACM
120views Database» more  VLDB 2004»
15 years 7 months ago
Relational link-based ranking
Link analysis methods show that the interconnections between web pages have lots of valuable information. The link analysis methods are, however, inherently oriented towards analy...
Floris Geerts, Heikki Mannila, Evimaria Terzi
CIVR
2008
Springer
165views Image Analysis» more  CIVR 2008»
15 years 3 months ago
Balancing thread based navigation for targeted video search
Various query methods for video search exist. Because of the semantic gap each method has its limitations. We argue that for effective retrieval query methods need to be combined ...
Ork de Rooij, Cees G. M. Snoek, Marcel Worring
129
Voted
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
15 years 5 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen