Sciweavers

1483 search results - page 145 / 297
» Geometric constraint satisfaction using optimization methods
Sort
View
VLSID
2003
IEEE
103views VLSI» more  VLSID 2003»
16 years 1 months ago
Minimum Dynamic Power CMOS Circuit Design by a Reduced Constraint Set Linear Program
In the previous work, the problem of nding gate delays to eliminate glitches has been solved by linear programs (LP) requiring an exponentially large number ofconstraints. By intr...
Tezaswi Raja, Vishwani D. Agrawal, Michael L. Bush...
CGF
2010
218views more  CGF 2010»
15 years 1 months ago
Mesh Snapping: Robust Interactive Mesh Cutting Using Fast Geodesic Curvature Flow
This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but re...
Juyong Zhang, Chunlin Wu, Jianfei Cai, Jianmin Zhe...
TITB
2002
172views more  TITB 2002»
15 years 29 days ago
Shape recovery algorithms using level sets in 2-D/3-D medical imagery: a state-of-the-art review
The class of geometric deformable models, also known as level sets, has brought tremendous impact to medical imagery due to its capability of topology preservation and fast shape r...
Jasjit S. Suri, Kecheng Liu, Sameer Singh, Swamy L...
MICCAI
2000
Springer
15 years 4 months ago
Multimodal Non-rigid Warping for Correction of Distortions in Functional MRI
This paper deals with the correction of distortions in EPI acquisitions. Echo-planar imaging (EPI) data is used in functional resonance imaging (fMRI) and in diffusion tensor MRI (...
Pierre Hellier, Christian Barillot
IPCO
2008
118views Optimization» more  IPCO 2008»
15 years 2 months ago
Constraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...