Sciweavers

1794 search results - page 178 / 359
» Visualizing Memory Graphs
Sort
View
FLAIRS
2006
15 years 7 months ago
Methods for Constructing Balanced Elimination Trees and Other Recursive Decompositions
A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time com...
Kevin Grant, Michael C. Horsch
CPHYSICS
2006
124views more  CPHYSICS 2006»
15 years 6 months ago
Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks
State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms s...
Cheng Zhang, Bhupesh Bansal, Paulo S. Branicio, Ra...
TCS
2008
15 years 6 months ago
Succinct representations of planar maps
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
Luca Castelli Aleardi, Olivier Devillers, Gilles S...
IJPP
2011
99views more  IJPP 2011»
15 years 1 months ago
Regular Lattice and Small-World Spin Model Simulations Using CUDA and GPUs
Data-parallel accelerator devices such as Graphical Processing Units (GPUs) are providing dramatic performance improvements over even multicore CPUs for lattice-oriented applicatio...
Kenneth A. Hawick, Arno Leist, Daniel P. Playne
UIST
2009
ACM
16 years 25 days ago
Relaxed selection techniques for querying time-series graphs
Time-series graphs are often used to visualize phenomena that change over time. Common tasks include comparing values at different points in time and searching for specified patte...
Christian Holz, Steven Feiner