Sciweavers

81 search results - page 8 / 17
» On the verification of polynomial system solvers
Sort
View
SAC
2010
ACM
14 years 2 months ago
Polytope-based computation of polynomial ranges
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensor...
Christoph Fünfzig, Dominique Michelucci, Sebt...
CONCUR
2010
Springer
13 years 7 months ago
Conditional Automata: A Tool for Safe Removal of Negligible Events
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
Roberto Segala, Andrea Turrini
ICLP
2010
Springer
13 years 5 months ago
A Framework for Verification and Debugging of Resource Usage Properties: Resource Usage Verification
We present a framework for (static) verification of general resource usage program properties. The framework extends the criteria of correctness as the conformance of a program to ...
Pedro López-García, Luthfi Darmawan,...
ICIP
2002
IEEE
14 years 9 months ago
Polynomial features for robust face authentication
In this paper we introduce the DCT-mod2 facial feature extraction technique which utilizes polynomial coefficients derived from 2-D DCT coefficients of spatially neighbouring bloc...
Conrad Sanderson, Kuldip K. Paliwal
LCTRTS
2007
Springer
14 years 1 months ago
Generalizing parametric timing analysis
In the design of real-time and embedded systems, it is important to establish a bound on the worst-case execution time (WCET) of programs to assure via schedulability analysis tha...
Joel Coffman, Christopher A. Healy, Frank Mueller,...