140 search results - page 26 / 28 » Random projection algorithms for convex set intersection pro... |
WWW
2005
ACM
15 years 10 months ago
2005
ACM
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
117
Voted
ESA
1995
Springer
15 years 1 months ago
1995
Springer
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
205
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
Given an object q, modeled by a multidimensional point, a reverse nearest neighbors (RNN) query returns the set of objects in the database that have q as their nearest neighbor. I...
PAKDD
2009
ACM
15 years 6 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
ICDM
2003
IEEE
15 years 2 months ago
2003
IEEE
A data set can be clustered in many ways depending on the clustering algorithm employed, parameter settings used and other factors. Can multiple clusterings be combined so that th...