Sciweavers

1984 search results - page 150 / 397
» The colourful feasibility problem
Sort
View
ICCAD
1993
IEEE
101views Hardware» more  ICCAD 1993»
14 years 2 months ago
Convexity-based algorithms for design centering
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. K...
CVPR
2008
IEEE
15 years 7 days ago
Local deformation models for monocular 3D shape recovery
Without a deformation model, monocular 3D shape recovery of deformable surfaces is severly under-constrained. Even when the image information is rich enough, prior knowledge of th...
Mathieu Salzmann, Raquel Urtasun, Pascal Fua
ICCV
2003
IEEE
15 years 4 days ago
Camera calibration using spheres: A semi-definite programming approach
Vision algorithms utilizing camera networks with a common field of view are becoming increasingly feasible and important. Calibration of such camera networks is a challenging and ...
Motilal Agrawal, Larry S. Davis
DAC
2008
ACM
14 years 11 months ago
Concurrent topology and routing optimization in automotive network integration
In this paper, a novel automatic approach for the concurrent topology and routing optimization that achieves a high quality network layout is proposed. This optimization is based ...
Bardo Lang, Christian Haubelt, Jürgen Teich, ...
DAC
2005
ACM
14 years 11 months ago
Race-condition-aware clock skew scheduling
The race conditions often limit the smallest feasible clock period that the optimal clock skew scheduling can achieve. Therefore, the combination of clock skew scheduling and dela...
Shih-Hsu Huang, Yow-Tyng Nieh, Feng-Pin Lu