1641 search results - page 121 / 329 » Termination Analysis with Algorithmic Learning |
139
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
This paper presents an approach to build Sparse Large Margin Classifiers (SLMC) by adding one more constraint to the standard Support Vector Machine (SVM) training problem. The ad...
136
click to vote
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
: In many computer vision classification problems, both the error and time characterizes the quality of a decision. We show that such problems can be formalized in the framework of...
125
click to vote
ICCV
2001
IEEE
16 years 5 months ago
2001
IEEE
Principal Component Analysis (PCA) has been widely used for the representation of shape, appearance, and motion. One drawback of typical PCA methods is that they are least squares...
126
click to vote
ASPDAC
2005
ACM
15 years 5 months ago
2005
ACM
－ It is a hotly research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. BFL algorithm is the most effective Counterexample minim...
185
click to vote
STOC
2000
ACM
15 years 8 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...