12519 search results - page 333 / 2504 » Approximation Problems Categories |
161
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose a new algorithm for Approximate Joint Diagonalization (AJD) with two main advantages over existing state-of-the-art algorithms: Improved overall running speed, especial...
215
click to vote
DEXAW
1999
IEEE
1999
IEEE
Using the Distance Distribution for Approximate Similarity Queries in High-Dimensional Metric Spaces
15 years 11 months ago
We investigate the problem of approximate similarity (nearest neighbor) search in high-dimensional metric spaces, and describe how the distance distribution of the query object ca...
168
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...
189
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
184
click to vote
SODA
1992
ACM
15 years 7 months ago
1992
ACM
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...