Sciweavers

81 search results - page 6 / 17
» On the verification of polynomial system solvers
Sort
View
SMA
2010
ACM
164views Solid Modeling» more  SMA 2010»
14 years 9 months ago
Topologically guaranteed univariate solutions of underconstrained polynomial systems via no-loop and single-component tests
We present an algorithm which robustly computes the intersection curve(s) of an under-constrained piecewise polynomial system consisting of n equations with n + 1 unknowns. The so...
Michael Barton, Gershon Elber, Iddo Hanniel
CSL
2006
Springer
15 years 1 months ago
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic
In a previous work we introduced Dual Light Affine Logic (DLAL) ([BT04]) as a variant of Light Linear Logic suitable for guaranteeing complexity properties on lambda-calculus terms...
Vincent Atassi, Patrick Baillot, Kazushige Terui
CAV
2008
Springer
161views Hardware» more  CAV 2008»
14 years 11 months ago
Constraint-Based Approach for Analysis of Hybrid Systems
Abstract. This paper presents a constraint-based technique for discovering a rich class of inductive invariants (boolean combinations of polynomial inequalities of bounded degree) ...
Sumit Gulwani, Ashish Tiwari
ECAI
2006
Springer
14 years 11 months ago
Solving Optimization Problems with DLL
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
Enrico Giunchiglia, Marco Maratea
AVBPA
2001
Springer
117views Biometrics» more  AVBPA 2001»
15 years 1 months ago
Hand Recognition Using Implicit Polynomials and Geometric Features
Person identification and verification using biometric methods is getting more and more important in today’s information society; resulting in increased utilization of systems th...
Cenker Öden, Aytül Erçil, Vedat T...