761 search results - page 24 / 153 » Efficient Approximation Algorithms for the Subset-Sums Equal... |
SIAMCOMP
2008
13 years 7 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
JDCTA
2010
13 years 2 months ago
2010
On clinical applications, many magnetic resonance (MR) Images obtained directly by the instruments are not satisfied by doctors. For example, there are some noises and poor contra...
TCS
2008
13 years 7 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
WAE
2000
13 years 9 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...