Sciweavers

7150 search results - page 217 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
COMPGEOM
2011
ACM
14 years 10 months ago
Deconstructing approximate offsets
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
Eric Berberich, Dan Halperin, Michael Kerber, Roza...
DAC
1998
ACM
15 years 10 months ago
Approximate Reachability with BDDs Using Overlapping Projections
Approximate reachability techniques trade o accuracy with the capacity to deal with bigger designs. Cho et al 3 proposed approximate FSM traversal algorithms over a partition of t...
Shankar G. Govindaraju, David L. Dill, Alan J. Hu,...
GECCO
2006
Springer
130views Optimization» more  GECCO 2006»
15 years 10 months ago
Filter approximation using explicit time and frequency domain specifications
We demonstrate that enhanced particle swarm optimization (PSO) can be successfully used to evolve high performance filter approximations. These evolved approximations use sets of ...
Varun Aggarwal, Wesley O. Jin, Una-May O'Reilly
AAECC
1995
Springer
137views Algorithms» more  AAECC 1995»
15 years 10 months ago
About Approximations of Exponentials
Abstract. We look for the approximation of exp(A1 + A2) by a product in form exp(x1A1) exp(y1A2) · · · exp(xnA1) exp(ynA2). We specially are interested in minimal approximations...
Pierre-Vincent Koseleff
ISBI
2004
IEEE
16 years 7 months ago
Multi-Modal Non-Rigid Registration Using a Stochastic Gradient Approximation
We present a new fast implementation of a non-rigid registration algorithm, based on a finite element elastic deformation model using the mutual information metric with a linear e...
Aloys du Bois d'Aische, Benoît Macq, Florian...