Sciweavers

160 search results - page 28 / 32
» Towards effective partition management for large graphs
Sort
View
IWMM
2009
Springer
152views Hardware» more  IWMM 2009»
15 years 4 months ago
A new approach to parallelising tracing algorithms
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
Cosmin E. Oancea, Alan Mycroft, Stephen M. Watt
BMCBI
2005
91views more  BMCBI 2005»
14 years 9 months ago
Providing visualisation support for the analysis of anatomy ontology data
Background: Improvements in technology have been accompanied by the generation of large amounts of complex data. This same technology must be harnessed effectively if the knowledg...
Aba-Sah Dadzie, Albert Burger
VISUALIZATION
1997
IEEE
15 years 2 months ago
Application-controlled demand paging for out-of-core visualization
In the area of scientific visualization, input data sets are often very large. In visualization of Computational Fluid Dynamics (CFD) in particular, input data sets today can surp...
Michael Cox, David Ellsworth
ICS
2005
Tsinghua U.
15 years 3 months ago
Disk layout optimization for reducing energy consumption
Excessive power consumption is becoming a major barrier to extracting the maximum performance from high-performance parallel systems. Therefore, techniques oriented towards reduci...
Seung Woo Son, Guangyu Chen, Mahmut T. Kandemir
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
13 years 10 days ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri