4903 search results - page 226 / 981 » The Set Covering Machine |
192
Voted
IPCO
2004
15 years 7 months ago
2004
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
160
click to vote
IJCAI
2003
15 years 7 months ago
2003
The intelligent tutoring system AutoTutor uses latent semantic analysis to evaluate student answers to the tutor's questions. By comparing a student's answer to a set of...
156
click to vote
AML
2010
15 years 6 months ago
2010
A Schnorr test relative to some oracle A may informally be called "universal" if it covers all Schnorr tests. Since no true universal Schnorr test exists, such an A cann...
157
click to vote
TSMC
2011
15 years 1 months ago
2011
— Most state-based approaches to fault diagnosis of discrete-event systems require a complete and accurate model of the system to be diagnosed. In this paper, we address the prob...
222
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Support Vector Machines (SVM) are one of the most useful
techniques in classification problems. One clear example
is face recognition. However, SVM cannot be applied
when the fe...