Sciweavers

1859 search results - page 253 / 372
» Using Problems to Learn Service-Oriented Computing
Sort
View
ICRA
2008
IEEE
204views Robotics» more  ICRA 2008»
15 years 11 months ago
Active exploration and keypoint clustering for object recognition
— Object recognition is a challenging problem for artificial systems. This is especially true for objects that are placed in cluttered and uncontrolled environments. To challenge...
Gert Kootstra, Jelmer Ypma, Bart de Boer
AAAI
2012
13 years 7 months ago
Dynamic Matching via Weighted Myopia with Application to Kidney Exchange
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
John P. Dickerson, Ariel D. Procaccia, Tuomas Sand...
ICML
2007
IEEE
16 years 5 months ago
Kernelizing PLS, degrees of freedom, and efficient model selection
Kernelizing partial least squares (PLS), an algorithm which has been particularly popular in chemometrics, leads to kernel PLS which has several interesting properties, including ...
Mikio L. Braun, Nicole Krämer
ICML
2006
IEEE
16 years 5 months ago
The relationship between Precision-Recall and ROC curves
Receiver Operator Characteristic (ROC) curves are commonly used to present results for binary decision problems in machine learning. However, when dealing with highly skewed datas...
Jesse Davis, Mark Goadrich
CIKM
2000
Springer
15 years 9 months ago
Boosting for Document Routing
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
Raj D. Iyer, David D. Lewis, Robert E. Schapire, Y...