Sciweavers

6740 search results - page 202 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
APVIS
2011
12 years 10 months ago
An extended evaluation of the readability of tapered, animated, and textured directed-edge representations in node-link graphs
We present the results of a study comparing five directed-edge representations for use in 2D, screen-based node-link diagrams. The goal of this work is to extend the understandin...
Danny Holten, Petra Isenberg, Jarke J. van Wijk, J...
LICS
2003
IEEE
14 years 4 months ago
Micro-Macro Stack Systems: A New Frontier of Elementary Decidability for Sequential Systems
We define the class of micro-macro stack graphs, a new class of graphs modeling infinite-state sequential systems with a decidable model-checking problem. Micro-macro stack grap...
Nir Piterman, Moshe Y. Vardi
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
14 years 3 days ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
ICML
2008
IEEE
14 years 11 months ago
Graph kernels between point clouds
Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and pra...
Francis R. Bach
CAE
2007
14 years 1 months ago
Stipple Placement using Distance in a Weighted Graph
We present a stipple placement method which provides extra emphasis to image features, especially edges. Our algorithm transforms an image into a regular graph, with edge weights ...
David Mould