Sciweavers

1794 search results - page 1 / 359
» Visualizing Memory Graphs
Sort
View
DAGSTUHL
2001
13 years 6 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
CHI
2010
ACM
13 years 11 months ago
Graphemes: self-organizing shape-based clustered structures for network visualisations
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
Ross Shannon, Aaron J. Quigley, Paddy Nixon
SOFTVIS
2005
ACM
13 years 10 months ago
Adding parallelism to visual data flow programs
Programming in parallel is an error-prone and complex task compounded by the lack of tool support for both programming and debugging. Recent advances in compiler-directed shared m...
Philip T. Cox, Simon Gauvin, Andrew Rau-Chaplin
PVG
2003
IEEE
138views Visualization» more  PVG 2003»
13 years 10 months ago
Sort-First, Distributed Memory Parallel Visualization and Rendering
While commodity computing and graphics hardware has increased in capacity and dropped in cost, it is still quite difficult to make effective use of such systems for general-purpos...
E. Wes Bethel, Greg Humphreys, Brian E. Paul, J. D...
APVIS
2006
13 years 6 months ago
Predicting graph reading performance: a cognitive approach
Performance and preference measures are commonly used in the assessment of visualization techniques. This is important and useful in understanding differences in effectiveness bet...
Weidong Huang, Seok-Hee Hong, Peter Eades