Sciweavers

44 search results - page 5 / 9
» Greedy drawings of triangulations
Sort
View
JDA
2010
88views more  JDA 2010»
13 years 5 months ago
Greedy colorings for the binary paintshop problem
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...
Hadis Amini, Frédéric Meunier, H&eac...
ALT
2002
Springer
14 years 4 months ago
A Pathology of Bottom-Up Hill-Climbing in Inductive Rule Learning
In this paper, we close the gap between the simple and straight-forward implementations of top-down hill-climbing that can be found in the literature, and the rather complex strate...
Johannes Fürnkranz
ACCV
2007
Springer
14 years 1 months ago
Fast Optimal Three View Triangulation
We consider the problem of L2-optimal triangulation from three separate views. Triangulation is an important part of numerous computer vision systems. Under gaussian noise, minimiz...
Martin Byröd, Klas Josephson, Kalle Åst...
ACMDIS
1997
ACM
13 years 11 months ago
HCI, Natural Science and Design: A Framework for Triangulation Across Disciplines
Human-computer interaction is multidisciplinary, drawing paradigms and techniques from both the natural sciences and the design disciplines. HCI cannot be considered a pure natura...
Wendy E. Mackay, Anne-Laure Fayard
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 7 months ago
Schnyder decompositions for regular plane graphs and application to drawing
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...
Olivier Bernardi, Éric Fusy