Sciweavers

2922 search results - page 457 / 585
» Scalable Algorithms for Distribution Search
Sort
View
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
15 years 7 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
SIGIR
2005
ACM
15 years 11 months ago
Exploiting the hierarchical structure for link analysis
Link analysis algorithms have been extensively used in Web information retrieval. However, current link analysis algorithms generally work on a flat link graph, ignoring the hiera...
Gui-Rong Xue, Qiang Yang, Hua-Jun Zeng, Yong Yu, Z...
VLDB
2005
ACM
177views Database» more  VLDB 2005»
15 years 11 months ago
Discovering Large Dense Subgraphs in Massive Graphs
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
David Gibson, Ravi Kumar, Andrew Tomkins
CIKM
2008
Springer
15 years 8 months ago
Ranking information resources in peer-to-peer text retrieval: an experimental study
This paper experimentally studies approaches to the problem of ranking information resources w.r.t. user queries in peer-to-peer information retrieval. In distributed environments...
Hans F. Witschel
GPEM
2000
121views more  GPEM 2000»
15 years 5 months ago
Bayesian Methods for Efficient Genetic Programming
ct. A Bayesian framework for genetic programming GP is presented. This is motivated by the observation that genetic programming iteratively searches populations of fitter programs ...
Byoung-Tak Zhang