Sciweavers

1450 search results - page 115 / 290
» On the Complexity of Hardness Amplification
Sort
View
AICCSA
2005
IEEE
82views Hardware» more  AICCSA 2005»
13 years 11 months ago
Reverse engineering of framework design using a meta-patterns-based approach
Object-oriented frameworks are a powerful reuse technique but they are also very complex and difficult to design. Framework’s design aims at separating the invariant aspects acr...
Nuno Flores, Ademar Aguiar
DAGM
2006
Springer
13 years 11 months ago
Low-Cost Laser Range Scanner and Fast Surface Registration Approach
In the last twenty years many approaches for contact-free measurement techniques for object surfaces and approaches for 3d object reconstruction have been proposed; but often they ...
Simon Winkelbach, Sven Molkenstruck, Friedrich M. ...
COCO
2008
Springer
100views Algorithms» more  COCO 2008»
13 years 11 months ago
Detecting Rational Points on Hypersurfaces over Finite Fields
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
Swastik Kopparty, Sergey Yekhanin
EVOW
2008
Springer
13 years 11 months ago
Evolving an Automatic Defect Classification Tool
Automatic Defect Classification (ADC) is a well-developed technology for inspection and measurement of defects on patterned wafers in the semiconductors industry. The poor training...
Assaf Glazer, Moshe Sipper
FM
2008
Springer
148views Formal Methods» more  FM 2008»
13 years 10 months ago
Precise Interval Analysis vs. Parity Games
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
Thomas Gawlitza, Helmut Seidl