Sciweavers

717 search results - page 32 / 144
» The Viewing Graph
Sort
View
DAGSTUHL
2001
13 years 10 months ago
Visualizing Memory Graphs
To understand the dynamics of a running program, it is often useful to examine its state at specific moments during its execution. We present memory graphs as a means to capture an...
Thomas Zimmermann, Andreas Zeller
ICDE
2010
IEEE
266views Database» more  ICDE 2010»
14 years 8 months ago
Provenance Browser: Displaying and Querying Scientific Workflow Provenance Graphs
Abstract-- This demonstration presents an interactive provenance browser for visualizing and querying data dependency (lineage) graphs produced by scientific workflow runs. The bro...
Bertram Ludäscher, Manish Kumar Anand, Shawn ...
DAM
2008
72views more  DAM 2008»
13 years 8 months ago
Minimization of circuit registers: Retiming revisited
In this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but...
Bruno Gaujal, Jean Mairesse
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
14 years 3 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
CSMR
1999
IEEE
14 years 1 months ago
Impact of Function Pointers on the Call Graph
Maintenance activities are made more difficult when pointers are heavily used in source code: the programmer needs to build a mental model of memory locations and of the way they ...
Giuliano Antoniol, F. Calzolari, Paolo Tonella