Sciweavers

1749 search results - page 178 / 350
» Conditional colorings of graphs
Sort
View
ICPR
2008
IEEE
16 years 7 months ago
Similarity-based matching for face authentication
We propose in this paper a face authentication method based on a similarity measure. The SIFT descriptor is used to define some interest keypoints characterized by an invariant pa...
Christophe Rosenberger, Luc Brun
111
Voted
CDC
2008
IEEE
105views Control Systems» more  CDC 2008»
16 years 1 months ago
On the stability of distance-based formation control
— This paper examines stability properties of distance-based formations. These are formations encoded by inter-agent relative distances. A negative gradient control law is propos...
Dimos V. Dimarogonas, Karl Henrik Johansson
CP
2005
Springer
16 years 5 days ago
Domain Reduction for the Circuit Constraint
Abstract. We present an incomplete filtering algorithm for the circuit constraint. The filter removes redundant values by eliminating nonHamiltonian edges from the associated gra...
Latife Genç Kaya, John N. Hooker
CSR
2008
Springer
15 years 8 months ago
Synchronization of Grammars
Abstract. Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizi...
Didier Caucal, Stéphane Hassen
OA
1989
237views Algorithms» more  OA 1989»
15 years 10 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph