1120 search results - page 36 / 224 » Parallel Algorithmic Techniques for Combinatorial Computatio... |
135
click to vote
IPPS
1996
IEEE
15 years 8 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...
179
Voted
ICPP
2000
IEEE
15 years 8 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. ...
124
click to vote
HPDC
2002
IEEE
15 years 9 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 ...
143
click to vote
COMPGEOM
2006
ACM
15 years 10 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...
126
click to vote
ALMOB
2006
15 years 4 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...