Sciweavers

852 search results - page 94 / 171
» Using graph parsing for automatic graph drawing
Sort
View
WADS
2007
Springer
121views Algorithms» more  WADS 2007»
15 years 4 months ago
Cauchy's Theorem and Edge Lengths of Convex Polyhedra
In this paper we explore, from an algorithmic point of view, the extent to which the facial angles and combinatorial structure of a convex polyhedron determine the polyhedron—in ...
Therese C. Biedl, Anna Lubiw, Michael J. Spriggs
COMGEO
2011
ACM
14 years 5 months ago
A computational approach to Conway's thrackle conjecture
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum ...
Radoslav Fulek, János Pach
ICMT
2009
Springer
15 years 4 months ago
Automatic Model Generation Strategies for Model Transformation Testing
Testing model transformations requires input models which are graphs of inter-connected objects that must conform to a meta-model and meta-constraints from heterogeneous sources su...
Sagar Sen, Benoit Baudry, Jean-Marie Mottu
IPPS
1996
IEEE
15 years 2 months ago
Commutativity Analysis: A Technique for Automatically Parallelizing Pointer-Based Computations
This paper introduces an analysis technique, commutativity analysis, for automatically parallelizing computations that manipulate dynamic, pointer-based data structures. Commutati...
Martin C. Rinard, Pedro C. Diniz
TASLP
2008
123views more  TASLP 2008»
14 years 10 months ago
Normalized Cuts for Predominant Melodic Source Separation
The predominant melodic source, frequently the singing voice, is an important component of musical signals. In this paper, we describe a method for extracting the predominant sourc...
Mathieu Lagrange, Luis Gustavo Martins, Jennifer M...