Sciweavers

10 search results - page 1 / 2
» Polynomial methods for component matching and verification
Sort
View
ICCAD
1998
IEEE
86views Hardware» more  ICCAD 1998»
13 years 8 months ago
Polynomial methods for component matching and verification
James Smith, Giovanni De Micheli
DATE
1999
IEEE
101views Hardware» more  DATE 1999»
13 years 9 months ago
Polynomial Methods for Allocating Complex Components
Methods for performing component matching by expressing an arithmetic specification and a bit-level description of an implementation as word-level polynomials have been demonstrat...
James Smith, Giovanni De Micheli
CONCUR
2010
Springer
13 years 5 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
CADE
2007
Springer
14 years 5 months ago
A Sequent Calculus for Integer Arithmetic with Counterexample Generation
We introduce a calculus for handling integer arithmetic in first-order logic. The method is tailored to Java program verification and meant to be used both as a supporting procedur...
Philipp Rümmer
PRL
2007
163views more  PRL 2007»
13 years 4 months ago
A model based approach for pose estimation and rotation invariant object matching
Pose estimation has been considered to be an important component in many pattern recognition and computer vision systems. In this paper, we introduce a pose estimation method base...
Cem Ünsalan