39 search results - page 4 / 8 » Average Bit-Complexity of Euclidean Algorithms |
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
We present a fast, robust and automatic method for computing central paths through tubular structures for application to virtual endoscopy. The key idea is to utilize a medial sur...
DCC
2003
IEEE
14 years 22 days ago
2003
IEEE
- Rate-distortion theory is applied to the problem of joint compression and classification. A Lagrangian distortion measure is used to consider both the squared Euclidean error in ...
STOC
2001
ACM
14 years 7 months ago
2001
ACM
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
SSD
2007
Springer
14 years 1 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 ...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...