255 search results - page 20 / 51 » Learning parallel portfolios of algorithms |
134
Voted
KDD
2001
ACM
16 years 3 months ago
2001
ACM
In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneo...
140
click to vote
CCO
2001
Springer
15 years 8 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
135
click to vote
KDD
2009
ACM
16 years 4 months ago
2009
ACM
In data publishing, anonymization techniques such as generalization and bucketization have been designed to provide privacy protection. In the meanwhile, they reduce the utility o...
143
click to vote
ISPASS
2009
IEEE
15 years 10 months ago
2009
IEEE
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
146
click to vote
PCI
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. It has been recently demonstrated that the classical EM algorithm for learning Gaussian mixture models can be successfully implemented in a decentralized manner by resort...