83 search results - page 1 / 17 » From Invariants to Canonization in Parallel |
CSR
2008
Springer
13 years 6 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
CAIP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. This paper proposes a new method to solve the problem of face recognition under varying illumination conditions. We introduce an exemplar-based technique to decouple and ...
AVSS
2003
IEEE
13 years 10 months ago
2003
IEEE
Human gait is a spatio-temporal phenomenon and typifies the motion characteristics of an individual. The gait of a person is easily recognizable when extracted from a sideview of...
ECCC
2011
12 years 11 months ago
2011
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
APAL
2004
13 years 4 months ago
2004
Abstract. We start by studying the relationship between two invariants isolated by Shelah, the sets of good and approachable points. As part of our study of these invariants, we pr...