4903 search results - page 765 / 981 » The Set Covering Machine |
181
click to vote
COLT
2001
Springer
15 years 10 months ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
165
Voted
ASPLOS
2000
ACM
15 years 10 months ago
2000
ACM
Simultaneous Multithreading machines fetch and execute instructions from multiple instruction streams to increase system utilization and speedup the execution of jobs. When there ...
166
Voted
COLT
1999
Springer
15 years 10 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
183
Voted
ALT
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We present a survey of recent results concerning the theoretical and empirical performance of algorithms for learning regularized least-squares classifiers. The behavior ...
153
click to vote
ECTEL
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Good teachers know their students, and exploit this knowledge to adapt or optimise their instruction. Teachers know their students because they interact with them face-to...