15792 search results - page 226 / 3159 » Computational Abstraction Steps |
164
click to vote
IVC
2006
15 years 7 months ago
2006
An exact analysis of the numerical errors being generated during the computation of the Zernike moments, by using the well-known `q-recursive' method, is attempted in this pa...
203
click to vote
CAD
1999
Springer
15 years 6 months ago
1999
Springer
This paper presents algorithms for computing offsets of NURBS curves and surfaces. The basic approach consists of four steps: (1) recognition of special curves and surfaces; (2) s...
181
click to vote
ICCV
2009
IEEE
17 years 4 days ago
2009
IEEE
We propose an algorithm for large displacement opti-
cal flow estimation which does not require the commonly
used coarse-to-fine warping strategy. It is based on a
quadratic rel...
185
click to vote
TACAS
2009
Springer
16 years 1 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
218
click to vote
CSFW
2006
IEEE
16 years 1 months ago
2006
IEEE
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...