Sciweavers

463 search results - page 12 / 93
» A General Framework for Graph Sparsification
Sort
View
STACS
2009
Springer
14 years 2 months ago
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
Glencora Borradaile, Erik D. Demaine, Siamak Tazar...
ML
2010
ACM
185views Machine Learning» more  ML 2010»
13 years 2 months ago
Learning to rank on graphs
Graph representations of data are increasingly common. Such representations arise in a variety of applications, including computational biology, social network analysis, web applic...
Shivani Agarwal
ECEASST
2006
72views more  ECEASST 2006»
13 years 7 months ago
ENFORCe: A System for Ensuring Formal Correctness of High-level Programs
Graph programs allow a visual description of programs on graphs and graph-like structures. The correctness of a graph program with respect to a pre- and a postcondition can be show...
Karl Azab, Annegret Habel, Karl-Heinz Pennemann, C...
TOG
2002
108views more  TOG 2002»
13 years 7 months ago
Motion graphs
In this paper we present a novel method for creating realistic, controllable motion. Given a corpus of motion capture data, we automatically construct a directed graph called a mo...
Lucas Kovar, Michael Gleicher, Frederic H. Pighin
VIZSEC
2004
Springer
14 years 1 months ago
Managing attack graph complexity through visual hierarchical aggregation
We describe a framework for managing network attack graph complexity through interactive visualization, which includes hierarchical aggregation of graph elements. Aggregation coll...
Steven Noel, Sushil Jajodia