1689 search results - page 89 / 338 » Proximate point searching |
105
Voted
COMPGEOM
2003
ACM
15 years 6 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
112
Voted
SIGIR
2009
ACM
15 years 7 months ago
2009
ACM
Large search engines process thousands of queries per second on billions of pages, making query processing a major factor in their operating costs. This has led to a lot of resear...
121
click to vote
SIGIR
2008
ACM
15 years 20 days ago
2008
ACM
This work presents the use of click graphs in improving query intent classifiers, which are critical if vertical search and general-purpose search services are to be offered in a ...
BMCBI
2006
15 years 24 days ago
2006
Background: The increasing availability of time-series expression data opens up new possibilities to study functional linkages of genes. Present methods used to infer functional l...
139
click to vote
COMGEO
2004
ACM
15 years 18 days ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...