874 search results - page 29 / 175 » Practical Algorithms for Selection on Coarse-Grained Paralle... |
134
click to vote
DMIN
2009
14 years 11 months ago
2009
While the emerging field of privacy preserving data mining (PPDM) will enable many new data mining applications, it suffers from several practical difficulties. PPDM algorithms are...
EUROPAR
2007
Springer
15 years 7 months ago
2007
Springer
Selecting the close-to-optimal collective algorithm based on the parameters of the collective call at run time is an important step for achieving good performance of MPI applicatio...
109
click to vote
CCS
2010
ACM
15 years 8 months ago
2010
ACM
In this paper, we introduce a framework for secure two-party (S2P) computations, which we call bureaucratic computing, and we demonstrate its efficiency by designing practical S2P...
147
click to vote
ICPP
2000
IEEE
15 years 5 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. ...
152
click to vote
CG
2008
Springer
15 years 1 months ago
2008
Springer
Particle-based simulation methods are used to model a wide range of complex phenomena and to solve time-dependent problems of various scales. Effective visualizations of the resul...