1105 search results - page 89 / 221 » Linear choosability of graphs |
120
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
A technique for calibrating a network of perspective cameras based on their graph of trifocal tensors is presented. After estimating a set of reliable epipolar geometries, a parame...
133
click to vote
ISLPED
2003
ACM
15 years 9 months ago
2003
ACM
This paper proposes two very fast graph theoretic heuristics for the low power binding problem given fixed number of resources and multiple architectures for the resources. First...
119
click to vote
ICVS
2003
Springer
15 years 9 months ago
2003
Springer
This paper shows how to construct a linear deformable model for graph structure by performing principal components analysis (PCA) on the vectorised adjacency matrix. We commence b...
151
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometri...
108
click to vote
ENTCS
2011
14 years 11 months ago
2011
d abstract) Andr´e Joyal 1 D´epartement des math´ematiques Universit´e du Qu´ebec `a Montr´eal Canada Joachim Kock 2 3 Departament de matem`atiques Universitat Aut`onoma de B...