Sciweavers

6045 search results - page 12 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
CVPR
2008
IEEE
14 years 9 months ago
Computing minimal deformations: application to construction of statistical shape models
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...
Darko Zikic, Michael Sass Hansen, Ben Glocker, Ali...
ESA
2005
Springer
131views Algorithms» more  ESA 2005»
14 years 1 months ago
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
Anne Bergeron, Cedric Chauve, Fabien de Montgolfie...
JSC
2002
61views more  JSC 2002»
13 years 7 months ago
Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm
This paper describes a new algorithm for computing linear generators (vector generating polynomials) for matrix sequences, running in subquadratic time. This algorithm applies in ...
Emmanuel Thomé