4524 search results - page 35 / 905 » The Complexity of Global Constraints |
94
Voted
VLSID
2002
IEEE
16 years 25 days ago
2002
IEEE
We describe a new algorithm for floorplan evaluation using timing-driven buffered routing according to a prescribed buffer site map. Specifically, we describe a provably good mult...
151
Voted
ECCV
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In this paper we present a new method for the 3D reconstruction of highly deforming surfaces (for instance a flag waving in the wind) viewed by a single orthographic came...
ICTAI
2006
IEEE
15 years 6 months ago
2006
IEEE
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
DCC
2004
IEEE
16 years 1 days 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 ...
CDC
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- Given a family of real or complex monic polynomials of fixed degree with one fixed affine constraint on their coefficients, consider the problem of minimizing the root r...