Sciweavers

281 search results - page 25 / 57
» On Embedding a Graph on Two Sets of Points
Sort
View
45
Voted
IPL
2006
98views more  IPL 2006»
14 years 9 months ago
Transforming spanning trees and pseudo-triangulations
Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T of TS are adjacent if T intersects T...
Oswin Aichholzer, Franz Aurenhammer, Clemens Hueme...
STACS
2007
Springer
15 years 3 months ago
Light Orthogonal Networks with Constant Geometric Dilation
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
Adrian Dumitrescu, Csaba D. Tóth
ICASSP
2008
IEEE
15 years 4 months ago
Symbol graph based discriminative training and rescoring for improved math symbol recognition
In the symbol recognition stage of online handwritten math expression recognition, the one-pass dynamic programming algorithm can produce high-quality symbol graphs in addition of...
Zhen Xuan Luo, Yu Shi, Frank K. Soong
IJCNN
2007
IEEE
15 years 4 months ago
3D-SE Viewer: A Text Mining Tool based on Bipartite Graph Visualization
—A new interactive visualization tool is proposed for textual data mining based on bipartite graph visualization. Applications to three text datasets are presented to show the ca...
Shiro Usui, Antoine Naud, Naonori Ueda, Tatsuki Ta...
JMIV
2008
97views more  JMIV 2008»
14 years 9 months ago
Fusion Graphs: Merging Properties and Watersheds
Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In this paper, we consider a segmentation as a set of connected r...
Jean Cousty, Gilles Bertrand, Michel Couprie, Laur...