Sciweavers

691 search results - page 35 / 139
» Non-negative graph embedding
Sort
View
CCCG
2009
13 years 9 months ago
On Directed Graphs with an Upward Straight-line
In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...
Carla Binucci, Emilio Di Giacomo, Walter Didimo, A...
WG
2010
Springer
13 years 6 months ago
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...
ECRTS
2008
IEEE
14 years 2 months ago
Temporal Analysis for Adapting Concurrent Applications to Embedded Systems
Embedded services and applications that interact with the real world often, over time, need to run on different kinds of hardware (low-cost microcontrollers to powerful multicore ...
Sibin Mohan, Johannes Helander
DM
2007
98views more  DM 2007»
13 years 8 months ago
Fast recognition of classes of almost-median graphs
In this paper it is shown that a class of almost-median graphs that includes all planar almost-median graphs can be recognized in O(m log n) time, where n denotes the number of ve...
Wilfried Imrich, Alenka Lipovec, Iztok Peterin, Pe...
ICPR
2008
IEEE
14 years 2 months ago
Semi-supervised learning by locally linear embedding in kernel space
Graph based semi-supervised learning methods (SSL) implicitly assume that the intrinsic geometry of the data points can be fully specified by an Euclidean distance based local ne...
Rujie Liu, Yuehong Wang, Takayuki Baba, Daiki Masu...