Sciweavers

1949 search results - page 164 / 390
» Random graphs on surfaces
Sort
View
FOCI
2007
IEEE
15 years 11 months ago
Faster Evolutionary Algorithms by Superior Graph Representation
— We present a new representation for individuals in problems that have cyclic permutations as solutions. To demonstrate its usefulness, we analyze a simple randomized local sear...
Benjamin Doerr, Christian Klein, Tobias Storch
DAGM
2008
Springer
15 years 6 months ago
MAP-Inference for Highly-Connected Graphs with DC-Programming
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
Jörg H. Kappes, Christoph Schnörr
COMBINATORICS
2002
87views more  COMBINATORICS 2002»
15 years 4 months ago
Map Genus, Forbidden Maps, and Monadic Second-Order Logic
A map is a graph equipped with a circular order of edges around each vertex. These circular orders represent local planar embeddings. The genus of a map is the minimal genus of an...
Bruno Courcelle, V. Dussaux
ICMCS
2006
IEEE
188views Multimedia» more  ICMCS 2006»
15 years 10 months ago
3D Face Identification Based on Arrangement of Salient Wrinkles
In this paper, we propose an original framework for three dimensional face representation and matching for identification purposes. Basic traits of a face are encoded by extracti...
Gianni Antini, Stefano Berretti, Alberto Del Bimbo...
ICMCS
2005
IEEE
169views Multimedia» more  ICMCS 2005»
15 years 10 months ago
Automatic 3D Face Recognition Using Topological Techniques
In this paper, we use the three-dimensionaltopological shape information for human face identification. We propose a new method to represent 3D faces as a topological graph. Fine...
Chafik Samir, Jean-Philippe Vandeborre, Mohamed Da...