1120 search results - page 36 / 224 » Parallel Algorithmic Techniques for Combinatorial Computatio... |
IPPS
1996
IEEE
15 years 1 months ago
1996
IEEE
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...
111
click to vote
ICPP
2000
IEEE
15 years 2 months ago
2000
IEEE
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
HPDC
2002
IEEE
15 years 2 months ago
2002
IEEE
Clusters of workstations have become a cost-effective means of performing scientific computations. However, large network latencies, resource sharing, and heterogeneity found in ...
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
We describe an implementation of a compact parallel algorithm for 3D Delaunay tetrahedralization on a 64-processor shared-memory machine. Our algorithm uses a concurrent version o...
ALMOB
2006
14 years 9 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...