1310 search results - page 197 / 262 » Learning the k in k-means |
113
click to vote
CRYPTO
2005
Springer
15 years 6 months ago
2005
Springer
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
107
click to vote
SIGECOM
2004
ACM
15 years 6 months ago
2004
ACM
We study a limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically. We suppose that agent valuations are drawn ...
NIPS
2003
15 years 2 months ago
2003
We investigate improvements of AdaBoost that can exploit the fact that the weak hypotheses are one-sided, i.e. either all its positive (or negative) predictions are correct. In pa...
102
Voted
CVPR
2006
IEEE
16 years 2 months ago
2006
IEEE
Ensemble methods such as bootstrap, bagging or boosting have had a considerable impact on recent developments in machine learning, pattern recognition and computer vision. Theoret...
95
Voted
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
We consider boosting algorithms that maintain a distribution over a set of examples. At each iteration a weak hypothesis is received and the distribution is updated. We motivate t...