4886 search results - page 745 / 978 » Approximate Data Exchange |
209
click to vote
SSD
2007
Springer
15 years 10 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
155
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
136
click to vote
ICDM
2005
IEEE
15 years 10 months ago
2005
IEEE
The most suitable method for the automated classification of protein structures remains an open problem in computational biology. In order to classify a protein structure with an...
156
Voted
CIKM
2003
Springer
15 years 9 months ago
2003
Springer
Reverse Nearest Neighbor (RNN) queries are of particular interest in a wide range of applications such as decision support systems, profile based marketing, data streaming, docum...
127
click to vote
PODS
1999
ACM
15 years 8 months ago
1999
ACM
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...