1728 search results - page 214 / 346 » The Accelerated Euclidean Algorithm |
194
click to vote
SSD
2007
Springer
15 years 9 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 ...
149
click to vote
ISAAC
2004
Springer
15 years 8 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
122
click to vote
VLDB
2001
ACM
15 years 7 months ago
2001
ACM
Similarity retrieval mechanisms should utilize generalized quadratic form distance functions as well as the Euclidean distance function since ellipsoid queries parameters may vary...
134
click to vote
ICA
2010
Springer
15 years 3 months ago
2010
Springer
We develop a probabilistic modeling framework for multiway arrays. Our framework exploits the link between graphical models and tensor factorization models and it can realize any ...
125
click to vote
PR
2000
15 years 3 months ago
2000
We propose a new technique for direct visual matching of images for the purposes of face recognition and image retrieval, using a probabilistic measure of similarity, based primar...