Sciweavers

765 search results - page 72 / 153
» Empirical Design of Geometric Algorithms
Sort
View
TOG
2008
130views more  TOG 2008»
14 years 11 months ago
Quadrilateral mesh simplification
We introduce a simplification algorithm for meshes composed of quadrilateral elements. It is reminiscent of edge-collapse based methods for triangle meshes, but takes a novel appr...
Joel Daniels II, Cláudio T. Silva, Jason Sh...
CAGD
2004
87views more  CAGD 2004»
14 years 11 months ago
Gliding spline motions and applications
We consider the ICP (iterative closest point) algorithm, which may in general be used for moving `active' elements such as curves and surfaces towards geometric objects whose...
Johannes Wallner
TOG
2002
127views more  TOG 2002»
14 years 11 months ago
Progressive lossless compression of arbitrary simplicial complexes
Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold ...
Pierre-Marie Gandoin, Olivier Devillers
DAC
2007
ACM
16 years 26 days ago
Modeling and Estimation of Full-Chip Leakage Current Considering Within-Die Correlation
We present an efficient technique for finding the mean and variance of the full-chip leakage of a candidate design, while considering logic-structures and both die-to-die and with...
Khaled R. Heloue, Navid Azizi, Farid N. Najm
ICML
2006
IEEE
16 years 20 days ago
Efficient inference on sequence segmentation models
Sequence segmentation is a flexible and highly accurate mechanism for modeling several applications. Inference on segmentation models involves dynamic programming computations tha...
Sunita Sarawagi