2720 search results - page 74 / 544 » Parallel Pairwise Clustering. |
100
click to vote
HPCC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
98
Voted
SC
2003
ACM
15 years 6 months ago
2003
ACM
We present a new adaptive fast multipole algorithm and its parallel implementation. The algorithm is kernel-independent in the sense that the evaluation of pairwise interactions do...
103
Voted
ICPPW
2003
IEEE
15 years 6 months ago
2003
IEEE
In this paper a simple but effective approach for parallelization of cellular neural networks for image processing is developed. Digital gray-scale images were used to evaluate th...
112
Voted
ESIAT
2009
IEEE
14 years 10 months ago
2009
IEEE
Comparing with the rapidly increasing acquiring technology for remotely sensed data, the data processing technologies have been following behind, especially in computing speed and ...
96
Voted
NIPS
2004
15 years 2 months ago
2004
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...