Sciweavers

3265 search results - page 123 / 653
» Representing Groups on Graphs
Sort
View
COMPGEOM
2010
ACM
15 years 9 months ago
Constructing Reeb graphs using cylinder maps
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...
Harish Doraiswamy, Aneesh Sood, Vijay Natarajan
ASSETS
2000
ACM
15 years 8 months ago
Constructing sonified haptic line graphs for the blind student: first steps
Line graphs stand as an established information visualisation and analysis technique taught at various levels of difficulty according to standard Mathematics curricula. Blind indi...
Rameshsharma Ramloll, Wai Yu, Stephen A. Brewster,...
125
Voted
ESA
2009
Springer
190views Algorithms» more  ESA 2009»
15 years 7 months ago
Polynomial-Time Algorithm for the Leafage of Chordal Graphs
Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
Michel Habib, Juraj Stacho
ICASSP
2009
IEEE
15 years 7 months ago
High-level feature extraction using SVM with walk-based graph kernel
We investigate a method using support vector machines (SVMs) with walk-based graph kernels for high-level feature extraction from images. In this method, each image is first segme...
Jean-Philippe Vert, Tomoko Matsui, Shin'ichi Satoh...
VISSYM
2007
15 years 6 months ago
Online Dynamic Graph Drawing
This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, ...
Yaniv Frishman, Ayellet Tal