Sciweavers

441 search results - page 59 / 89
» Convex Graph Invariants
Sort
View
EJC
2008
13 years 7 months ago
Grad and classes with bounded expansion I. Decompositions
Abstract. We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new ...
Jaroslav Nesetril, Patrice Ossona de Mendez
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
13 years 11 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
DCG
2008
82views more  DCG 2008»
13 years 7 months ago
Schnyder Woods and Orthogonal Surfaces
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
Stefan Felsner, Florian Zickfeld
SIGMOD
2003
ACM
112views Database» more  SIGMOD 2003»
14 years 7 months ago
A Theory of Redo Recovery
Our goal is to understand redo recovery. We define an installation graph of operations in an execution, an ordering significantly weaker than conflict ordering from concurrency co...
David B. Lomet, Mark R. Tuttle
ICB
2007
Springer
238views Biometrics» more  ICB 2007»
13 years 11 months ago
Keypoint Identification and Feature-Based 3D Face Recognition
We present a feature-based 3D face recognition algorithm and propose a keypoint identification technique which is repeatable and identifies keypoints where shape variation is high ...
Ajmal S. Mian, Mohammed Bennamoun, Robyn A. Owens