676 search results - page 62 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
166
click to vote
SIAMSC
2010
15 years 4 months ago
2010
The shift-invert Arnoldi method is employed to generate an orthonormal basis from the Krylov subspace corresponding to a real Toeplitz matrix and an initial vector. The vectors and...
182
click to vote
TALG
2010
15 years 26 days ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
133
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
149
click to vote
FOCS
2006
IEEE
16 years 6 days ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
160
click to vote
TSP
2008
15 years 6 months ago
2008
We propose a wireless fading channel prediction algorithm for a pilot-symbol aided Orthogonal Frequency Division Multiplexing (OFDM) system. Assuming a doubly selective (time and ...