Sciweavers

785 search results - page 74 / 157
» Embedding a Forest in a Graph
Sort
View
ICMCS
2007
IEEE
180views Multimedia» more  ICMCS 2007»
14 years 4 months ago
Discrete Regularization for Perceptual Image Segmentation via Semi-Supervised Learning and Optimal Control
In this paper, we present a regularization approach on discrete graph spaces for perceptual image segmentation via semisupervised learning. In this approach, first, a spectral cl...
Hongwei Zheng, Olaf Hellwich
IV
2003
IEEE
116views Visualization» more  IV 2003»
14 years 3 months ago
Visualization of Semantic Metadata and Ontologies
Implicit information embedded in semantic web graphs, such as topography, clusters, and disconnected subgraphs is difficult to extract from text files. Visualizations of the graph...
Paul Mutton, Jennifer Golbeck
JGAA
1998
116views more  JGAA 1998»
13 years 10 months ago
New Lower Bounds For Orthogonal Drawings
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for or...
Therese C. Biedl
CVPR
2010
IEEE
14 years 4 months ago
One-Shot Multi-Set Non-rigid Feature-Spatial Matching
We introduce a novel framework for nonrigid feature matching among multiple sets in a way that takes into consideration both the feature descriptor and the features spatial arra...
Marwan Torki and Ahmed Elgammal
ISAAC
2003
Springer
96views Algorithms» more  ISAAC 2003»
14 years 3 months ago
On the Geometric Dilation of Finite Point Sets
Let G be an embedded planar graph whose edges may be curves. For two arbitrary points of G, we can compare the length of the shortest path in G connecting them against their Euclid...
Annette Ebbers-Baumann, Ansgar Grüne, Rolf Kl...