Sciweavers

1794 search results - page 55 / 359
» Visualizing Memory Graphs
Sort
View
135
Voted
PPOPP
2012
ACM
13 years 10 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
165
Voted
IPPS
2007
IEEE
15 years 8 months ago
Software and Algorithms for Graph Queries on Multithreaded Architectures
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
Jonathan W. Berry, Bruce Hendrickson, Simon Kahan,...
127
Voted
IV
2008
IEEE
158views Visualization» more  IV 2008»
15 years 9 months ago
ComVis: A Coordinated Multiple Views System for Prototyping New Visualization Technology
There is a large number of interactive visualization tools, however no universal tool exists that covers all relevant aspects for all possible application domains. We have develop...
Kresimir Matkovic, Wolfgang Freiler, Denis Gracani...
CGF
2010
118views more  CGF 2010»
15 years 2 months ago
The Readability of Path-Preserving Clusterings of Graphs
Graph visualization systems often exploit opaque metanodes to reduce visual clutter and improve the readability of large graphs. This filtering can be done in a path-preserving wa...
Daniel Archambault, Helen C. Purchase, Bruno Pinau...
139
Voted
ICIP
2009
IEEE
15 years 8 days ago
Selecting representative and distinctive descriptors for efficient landmark recognition
To have a robust and informative image content representation for image categorization, we often need to extract as many as possible visual features at various locations, scales a...
Sheng Gao, Joo-Hwee Lim