6105 search results - page 296 / 1221 » A Parallel Algorithm for Bound-Smoothing |
152
click to vote
FCS
2006
15 years 8 months ago
2006
In this paper, we concentrate on the problem of computing a Voronoi diagram using Hypercube model of computation. The main contribution of this work is the O(log3 n) parallel algor...
200
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Biclustering refers to simultaneous clustering of objects and their features. Use of biclustering is gaining momentum in areas such as text mining, gene expression analysis and co...
223
Voted
BIBM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—Unacceptable execution time of Non-rigid registration (NRR) often presents a major obstacle to its routine clinical use. Parallel computing is an effective way to accele...
162
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
The computation of covariance and correlation matrices are critical to many data mining applications and processes. Unfortunately the classical covariance and correlation matrices...
200
click to vote
ICDT
2001
ACM
15 years 11 months ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...