Sciweavers

489 search results - page 42 / 98
» Support tools for graphs in computer science
Sort
View
SIGSOFT
2007
ACM
16 years 2 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
APVIS
2008
15 years 2 months ago
ZAME: Interactive Large-Scale Graph Visualization
We present the Zoomable Adjacency Matrix Explorer (ZAME), a visualization tool for exploring graphs at a scale of millions of nodes and edges. ZAME is based on an adjacency matrix...
Niklas Elmqvist, Thanh-Nghi Do, Howard Goodell, Na...
ICCS
2007
Springer
15 years 5 months ago
A Dataflow-Oriented Atomicity and Provenance System for Pipelined Scientific Workflows
Scientific workflows have gained great momentum in recent years due to their critical roles in e-Science and cyberinfrastructure applications. However, some tasks of a scientific w...
Liqiang Wang, Shiyong Lu, Xubo Fei, Jeffrey L. Ram
DBSEC
2009
124views Database» more  DBSEC 2009»
15 years 2 months ago
Towards System Integrity Protection with Graph-Based Policy Analysis
Abstract. Identifying and protecting the trusted computing base (TCB) of a system is an important task, which is typically performed by designing and enforcing a system security po...
Wenjuan Xu, Xinwen Zhang, Gail-Joon Ahn
GD
1999
Springer
15 years 5 months ago
Isomorphic Subgraphs
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
Sabine Bachl