1182 search results - page 89 / 237 » Iterative Methods in Combinatorial Optimization |
137
click to vote
DCC
2004
IEEE
16 years 5 months ago
2004
IEEE
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...
165
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
In this paper we propose a general framework to solve the articulated shape matching problem, formulated as finding point-to-point correspondences between two shapes represented b...
191
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
188
click to vote
TSMC
2011
15 years 1 months ago
2011
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
116
click to vote
IPMI
2005
Springer
16 years 7 months ago
2005
Springer
We propose a technique to accurately correct the spherical topology of cortical surfaces. We construct a mapping from the original surface onto the sphere to detect topological def...