Sciweavers

1794 search results - page 14 / 359
» Visualizing Memory Graphs
Sort
View
PPOPP
2009
ACM
16 years 8 days ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
VIZSEC
2004
Springer
15 years 5 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
ICPR
2004
IEEE
16 years 25 days ago
Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
Fred W. DePiero
SPIRE
2007
Springer
15 years 5 months ago
A Fast and Compact Web Graph Representation
Compressed graphs representation has become an attractive research topic because of its applications to the manipulation of huge Web graphs in main memory. By far the best current ...
Francisco Claude, Gonzalo Navarro
INFOVIS
2000
IEEE
15 years 4 months ago
Density Functions for Visual Attributes and Effective Partitioning in Graph Visualization
Two tasks in Graph Visualization require partitioning: the assignment of visual attributes and divisive clustering. Often, we would like to assign a color or other visual attribut...
Ivan Herman, M. Scott Marshall, Guy Melanço...