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...
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,...
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...
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...
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...