4843 search results - page 102 / 969 » The Shortcut Problem - Complexity and Approximation |
160
click to vote
WAE
2000
15 years 7 months ago
2000
Abstract. In this paper we present a heuristic based on dynamic approximations for improving the well-known Schnorr-Euchner lattice basis reduction algorithm. In particular, the ne...
165
click to vote
ISCAS
2006
IEEE
16 years 9 days ago
2006
IEEE
— A new technique that makes use of a systolic array structure is proposed for solving the common approximate substring (CAS) problem. This approach extends the technique introdu...
144
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
The metric 2-clustering problem is de ned as follows: given a metric (X;d), partition X into two sets S1 and S2 in order to minimize the value of X i X fu;vg Si d(u;v) In this pap...
155
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
We consider the special case of the traveling salesman problem TSP in which the distance metric is the shortest-path metric of a planar unweighted graph. We present a polynomial...
142
click to vote
TC
2008
15 years 6 months ago
2008
In this paper, the problem of finding good wordlength combinations for fixed-point digital signal processing flowgraphs is addressed. By formulating and solving an approximate opti...