Sciweavers

72 search results - page 5 / 15
» The Isomorphism Problem on Classes of Automatic Structures
Sort
View
AC
2000
Springer
13 years 12 months ago
Graph-Theoretical Methods in Computer Vision
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...
Ali Shokoufandeh, Sven J. Dickinson
FOCS
2007
IEEE
14 years 1 months ago
Can you beat treewidth?
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Dániel Marx
LICS
1999
IEEE
13 years 12 months ago
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
Albert Atserias, Phokion G. Kolaitis
CORR
2002
Springer
123views Education» more  CORR 2002»
13 years 7 months ago
Ideal decompositions and computation of tensor normal forms
Abstract. Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[Sr] of a symmetric group Sr. If for a class of tenso...
Bernd Fiedler
GECCO
2005
Springer
110views Optimization» more  GECCO 2005»
14 years 1 months ago
A genetic algorithm encoding for a class of cardinality constraints
A genetic algorithm encoding is proposed which is able to automatically satisfy a class of important cardinality constraints where the set of distinct values of the design variabl...
Helio J. C. Barbosa, Afonso C. C. Lemonge