Sciweavers

1723 search results - page 301 / 345
» Cycling in linear programming problems
Sort
View
CVPR
2010
IEEE
15 years 5 months ago
Specular Surface Reconstruction from Sparse Reflection Correspondences
We present a practical approach for surface reconstruction of smooth mirror-like objects using sparse reflection correspondences (RCs). Assuming finite object motion with a fix...
Aswin Sankaranarayanan, Ashok Veeraraghavan, Oncel...
CVPR
2010
IEEE
15 years 5 months ago
Efficiently Selecting Regions for Scene Understanding
Recent advances in scene understanding and related tasks have highlighted the importance of using regions to reason about high-level scene structure. Typically, the regions are ...
M. Pawan Kumar, Daphne Koller
ISPD
2010
ACM
177views Hardware» more  ISPD 2010»
15 years 4 months ago
Skew management of NBTI impacted gated clock trees
NBTI (Negative Bias Temperature Instability) has emerged as the dominant failure mechanism for PMOS in nanometer IC designs. However, its impact on one of the most important compo...
Ashutosh Chakraborty, David Z. Pan
SAC
2010
ACM
15 years 4 months ago
Constraint-based LN-curves
We consider the design of parametric curves from geometric constraints such as distance from lines or points and tangency to lines or circles. We solve the Hermite problem with su...
Young Joon Ahn, Christoph M. Hoffmann
SAC
2010
ACM
15 years 4 months ago
Polytope-based computation of polynomial ranges
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensor...
Christoph Fünfzig, Dominique Michelucci, Sebt...