Sciweavers

283 search results - page 48 / 57
» Bounds on the Generalization Performance of Kernel Machine E...
Sort
View
KDD
2005
ACM
143views Data Mining» more  KDD 2005»
14 years 7 months ago
SVM selective sampling for ranking with application to data retrieval
Learning ranking (or preference) functions has been a major issue in the machine learning community and has produced many applications in information retrieval. SVMs (Support Vect...
Hwanjo Yu
ICAC
2009
IEEE
14 years 2 months ago
Out-of-band detection of boot-sequence termination events
The popularization of both virtualization and CDP technologies mean that we can now watch disk accesses of systems from entities which are not controlled by the OS. This is a rich...
Naama Parush, Dan Pelleg, Muli Ben-Yehuda, Paula T...
IPPS
2009
IEEE
14 years 2 months ago
Minimizing startup costs for performance-critical threading
—Using the well-known ATLAS and LAPACK dense linear algebra libraries, we demonstrate that the parallel management overhead (PMO) can grow with problem size on even statically sc...
Anthony M. Castaldo, R. Clint Whaley
NIPS
2003
13 years 8 months ago
Max-Margin Markov Networks
In typical classification tasks, we seek a function which assigns a label to a single object. Kernel-based approaches, such as support vector machines (SVMs), which maximize the ...
Benjamin Taskar, Carlos Guestrin, Daphne Koller
COLT
2005
Springer
14 years 26 days ago
Margin-Based Ranking Meets Boosting in the Middle
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...
Cynthia Rudin, Corinna Cortes, Mehryar Mohri, Robe...