Sciweavers

263 search results - page 27 / 53
» Efficient Variants of the ICP Algorithm
Sort
View
STOC
2003
ACM
154views Algorithms» more  STOC 2003»
16 years 2 days ago
Boosting in the presence of noise
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...
Adam Kalai, Rocco A. Servedio
CORR
2010
Springer
130views Education» more  CORR 2010»
14 years 12 months ago
Approximated Structured Prediction for Learning Large Scale Graphical Models
In this paper we propose an approximated structured prediction framework for large scale graphical models and derive message-passing algorithms for learning their parameters effic...
Tamir Hazan, Raquel Urtasun
CACM
2010
105views more  CACM 2010»
14 years 12 months ago
Censored exploration and the dark pool problem
We introduce and analyze a natural algorithm for multi-venue exploration from censored data, which is motivated by the Dark Pool Problem of modern quantitative finance. We prove t...
Kuzman Ganchev, Yuriy Nevmyvaka, Michael Kearns, J...
MSS
2008
IEEE
118views Hardware» more  MSS 2008»
14 years 11 months ago
Computing the minimal covering set
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset...
Felix Brandt, Felix A. Fischer
CORR
2010
Springer
172views Education» more  CORR 2010»
14 years 10 months ago
Integrating User's Domain Knowledge with Association Rule Mining
This paper presents a variation of Apriori algorithm that includes the role of domain expert to guide and speed up the overall knowledge discovery task. Usually, the user is inter...
Vikram Singh, Sapna Nagpal