11565 search results - page 40 / 2313 » Computing Minimal Mappings |
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
Nonlinear registration is mostly performed after initialization by a global, linear transformation (in this work, we focus on similarity transformations), computed by a linear reg...
ECCV
2006
Springer
14 years 10 months ago
2006
Springer
Efficient direct solutions for the determination of a cylinder from points are presented. The solutions range from the well known direct solution of a quadric to the minimal soluti...
ICFCA
2005
Springer
14 years 2 months ago
2005
Springer
Minimal generators (or mingen) constitute a remarkable part of the closure space landscape since they are the antipodes of the closures, i.e., minimal sets in the underlying equiva...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an n × n matrix over a finite field that requires O(n3 ) field operations and O(n) random v...
ICCAD
2007
IEEE
14 years 5 months ago
2007
IEEE
— Computing counterexamples is a crucial task for error diagnosis and debugging of sequential systems. If an implementation does not fulfill its specification, counterexamples ...