1261 search results - page 162 / 253 » Approximation algorithms for aligning points |
233
click to vote
SSD
2007
Springer
16 years 9 days 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
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
197
click to vote
IEEEMSP
2002
IEEE
15 years 11 months ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
182
click to vote
PLDI
1999
ACM
15 years 10 months ago
1999
ACM
This paper presents a novel interprocedural, ow-sensitive, and context-sensitive pointer analysis algorithm for multithreaded programs that may concurrently update shared pointers...
128
click to vote
COMPGEOM
2006
ACM
16 years 5 days ago
2006
ACM
We consider the problem of balancing the load among m service-providing facilities, while keeping the total cost low. Let R be the underlying demand region, and let p1, . . . , pm...