Sciweavers

17 search results - page 3 / 4
» Fast connected component labeling algorithm using a divide a...
Sort
View
IPPS
2005
IEEE
14 years 2 months ago
An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
Guojing Cong, David A. Bader
BMCBI
2007
93views more  BMCBI 2007»
13 years 8 months ago
The topology of metabolic isotope labeling networks
Background: Metabolic Flux Analysis (MFA) based on isotope labeling experiments (ILEs) is a widely established tool for determining fluxes in metabolic pathways. Isotope labeling ...
Michael Weitzel, Wolfgang Wiechert, Katharina N&ou...
CIKM
2005
Springer
14 years 2 months ago
Compact reachability labeling for graph-structured data
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
Hao He, Haixun Wang, Jun Yang 0001, Philip S. Yu
VIS
2004
IEEE
138views Visualization» more  VIS 2004»
14 years 9 months ago
Dual Contouring with Topology-Preserving Simplification Using Enhanced Cell Representation
We present a fast, topology-preserving approach for isosurface simplification. The underlying concept behind our approach is to preserve the disconnected surface components in cel...
Nan Zhang 0011, Wei Hong, Arie E. Kaufman
MODELS
2009
Springer
14 years 3 months ago
An Incremental Algorithm for High-Performance Runtime Model Consistency
We present a novel technique for applying two-level runtime models to distributed systems. Our approach uses graph rewriting rules to transform a high-level source model into one o...
Christopher Wolfe, T. C. Nicholas Graham, W. Greg ...