Sciweavers

63 search results - page 2 / 13
» Connected Components with Split and Merge
Sort
View
PE
2008
Springer
89views Optimization» more  PE 2008»
13 years 5 months ago
Merging and splitting autocorrelated arrival processes and impact on queueing performance
We have proposed a three-parameter renewal approximation to analyze splitting and superposition of autocorrelated processes. We define the index of dispersion for counts of an ord...
Baris Balcioglu, David L. Jagerman, Tayfur Altiok
SMI
2005
IEEE
13 years 11 months ago
Subdomain Aware Contour Trees and Contour Evolution in Time-Dependent Scalar Fields
For time-dependent scalar fields, one is often interested in topology changes of contours in time. In this paper, we focus on describing how contours split and merge over a certa...
Andrzej Szymczak
IICS
2005
Springer
13 years 11 months ago
Distributed Calculation of PageRank Using Strongly Connected Components
We provide an approach to distribute the calculation of PageRank, by splitting the graph into its strongly connected components. As we prove, the global ranking may be calculated c...
Michael Brinkmeier
ICPP
1993
IEEE
13 years 10 months ago
Solving the Region Growing Problem on the Connection Machine
Abstract { This paper presents a parallel algorithm for solving the region growing problem based on the split and merge approach. The algorithm was implemented on the CM-2 and the ...
Nawal Copty, Sanjay Ranka, Geoffrey Fox, Ravi V. S...
IPPS
1996
IEEE
13 years 10 months ago
Parallel Algorithms for Image Enhancement and Segmentation by Region Growing with an Experimental Study
This paper presents e cient and portable implementations of a useful image enhancement process, the Symmetric Neighborhood Filter SNF, and an image segmentation technique which ma...
David A. Bader, Joseph JáJá, David H...