Sciweavers

1633 search results - page 142 / 327
» Planar Map Graphs
Sort
View
EMMCVPR
2007
Springer
14 years 2 months ago
Efficient Shape Matching Via Graph Cuts
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...
ESA
2006
Springer
77views Algorithms» more  ESA 2006»
14 years 2 months ago
Traversing the Machining Graph
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag m...
Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao W...
IV
2007
IEEE
164views Visualization» more  IV 2007»
14 years 4 months ago
Combining DagMaps and Sugiyama Layout for the Navigation of Hierarchical Data
This paper presents a novel technique for exploring and navigating large hierarchies, not restricted to trees but to directed acyclic graphs (dags). The technique combines two dif...
Pierre-Yves Koenig, Guy Melançon, Charles B...
EKAW
2008
Springer
14 years 5 days ago
Mapping General-Specific Noun Relationships to WordNet Hypernym/Hyponym Relations
In this paper, we propose a new methodology based on directed graphs and the TextRank algorithm to automatically induce general-specific noun relations from web corpora frequency c...
Gaël Dias, Raycho Mukelov, Guillaume Cleuziou
ALGORITHMICA
2007
80views more  ALGORITHMICA 2007»
13 years 10 months ago
Tree Spanners for Bipartite Graphs and Probe Interval Graphs
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...
Andreas Brandstädt, Feodor F. Dragan, Ho&agra...