Sciweavers

1383 search results - page 173 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
16 years 17 days ago
Rigorous analyses of simple diversity mechanisms
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann

Publication
307views
16 years 17 days ago
Scale and Rotation Invariant Detection of Singular Patterns in Vector Flow Fields
We present a method for detecting and describing features in vector flow fields. Our method models flow fields locally using a linear combination of complex monomials. These monomi...
Wei Liu, Eraldo Ribeiro
ISAAC
2007
Springer
146views Algorithms» more  ISAAC 2007»
16 years 17 days ago
Bounded Tree-Width and CSP-Related Problems
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
Tommy Färnqvist, Peter Jonsson
ISSAC
2007
Springer
142views Mathematics» more  ISSAC 2007»
16 years 17 days ago
Fast arithmetic for triangular sets: from theory to practice
We study arithmetic operations for triangular families of polynomials, concentrating on multiplication in dimension zero. By a suitable extension of fast univariate Euclidean divi...
Xin Li, Marc Moreno Maza, Éric Schost
ISSAC
2007
Springer
147views Mathematics» more  ISSAC 2007»
16 years 17 days ago
Differential equations for algebraic functions
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their po...
Alin Bostan, Frédéric Chyzak, Bruno ...