Sciweavers

684 search results - page 43 / 137
» A characterization of b-perfect graphs
Sort
View
CORR
2004
Springer
108views Education» more  CORR 2004»
15 years 1 months ago
The lattice dimension of a graph
The Fibonacci dimension fdim(G) of a graph G is introduced as the smallest integer f such that G admits an isometric embedding into f , the f-dimensional Fibonacci cube. We give b...
David Eppstein
SIAMDM
2008
123views more  SIAMDM 2008»
15 years 1 months ago
Adapted List Coloring of Graphs and Hypergraphs
We introduce and study adapted list coloring of graphs and hypergraphs. This is a generalization of ordinary list coloring and adapted coloring, and has more applications than thes...
Alexandr V. Kostochka, Xuding Zhu
112
Voted
ASWC
2009
Springer
15 years 8 months ago
Querying the Web of Data: A Formal Approach
Abstract. The increasing amount of interlinked RDF data has finally made available the necessary building blocks for the web of data. This in turns makes it possible (and interest...
Paolo Bouquet, Chiara Ghidini, Luciano Serafini
114
Voted
ICPR
2008
IEEE
16 years 3 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
67
Voted
CDC
2008
IEEE
105views Control Systems» more  CDC 2008»
15 years 8 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