613 search results - page 82 / 123 » Generalized Traveling Salesman Problem Reduction Algorithms |
129
Voted
TASLP
2010
14 years 9 months ago
2010
Abstract--This paper considers a psychoacoustically constrained and distortion minimized speech enhancement algorithm. Noise reduction, in general, leads to speech distortion, and ...
123
Voted
DAC
2004
ACM
16 years 3 months ago
2004
ACM
The advent of strong multi-level partitioners has made topdown min-cut placers a favored choice for modern placer implementations. We examine terminal propagation, an important st...
216
click to vote
Book
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
131
Voted
IJAC
2006
15 years 2 months ago
2006
It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a...
143
Voted
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...