4432 search results - page 451 / 887 » Solving Demodulation as an Optimization Problem |
122
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
126
click to vote
SGP
2007
15 years 6 months ago
2007
We propose a constraint-based method for the fairing of surface meshes. The main feature of our approach is that the resulting smoothed surface remains within a prescribed distanc...
124
click to vote
IPCO
2001
15 years 5 months ago
2001
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating ...
144
click to vote
NIPS
2001
15 years 5 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
100
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We show that the point containment problem in the integer hull of a polyhedron, which is defined by m inequalities, with coefficients of at most bits can be solved in time O(m + ...