Sciweavers

1794 search results - page 34 / 359
» Visualizing Memory Graphs
Sort
View
92
Voted
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 2 months ago
On Dynamic Breadth-First Search in External-Memory
We provide the first non-trivial result on dynamic breadth-first search (BFS) in external-memory: For general sparse undirected graphs of initially n nodes and O(n) edges and monot...
Ulrich Meyer
113
Voted
DAM
2007
100views more  DAM 2007»
15 years 2 months ago
Memory management optimization problems for integrated circuit simulators
In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to ...
Timothée Bossart, Alix Munier Kordon, Franc...
CAE
2007
15 years 4 months ago
The Aesthetics of Graph Visualization
The discipline of graph visualization produces pictorial representations of node
Chris Bennett, Jody Ryall, Leo Spalteholz, Amy Goo...
132
Voted
CF
2007
ACM
15 years 6 months ago
An analysis of the effects of miss clustering on the cost of a cache miss
In this paper we describe a new technique, called pipeline spectroscopy, and use it to measure the cost of each cache miss. The cost of a miss is displayed (graphed) as a histogra...
Thomas R. Puzak, Allan Hartstein, Philip G. Emma, ...
ENTCS
2006
161views more  ENTCS 2006»
15 years 2 months ago
Overview of Formal Concepts for Model Transformations Based on Typed Attributed Graph Transformation
In this paper we give an overview of formal concepts for model transformations between visual languages based on typed attributed graph transformation. We start with a basic conce...
Hartmut Ehrig, Karsten Ehrig