3281 search results - page 632 / 657 » Bases for parametrized iterativity |
ISPD
2000
ACM
15 years 4 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
109
click to vote
COCO
2000
Springer
15 years 4 months ago
2000
Springer
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
112
click to vote
CP
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
ICCV
1999
IEEE
15 years 4 months ago
1999
IEEE
This paper considers the problem of self-calibration of a camera from an image sequence in the case where the camera's internal parameters (most notably focal length) may cha...
EMMCVPR
1999
Springer
15 years 4 months ago
1999
Springer
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we conside...