241 search results - page 22 / 49 » Efficient Parallel Algorithms for Euclidean Distance Transfo... |
132
click to vote
NIPS
2004
15 years 4 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
120
click to vote
IPPS
2002
IEEE
15 years 7 months ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
185
click to vote
SSD
2007
Springer
15 years 8 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 ...
147
Voted
PAMI
2006
15 years 2 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
130
click to vote
SIPS
2008
IEEE
15 years 9 months ago
2008
IEEE
Modern microprocessor technology is migrating from simply increasing clock speeds on a single processor to placing multiple processors on a die to increase throughput and power pe...