3694 search results - page 531 / 739 » Stochastic complexity in learning |
204
click to vote
COLT
1993
Springer
15 years 10 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
176
click to vote
CEAS
2006
Springer
15 years 10 months ago
2006
Springer
One of the biggest challenges in building effective anti-spam solutions is designing systems to defend against the everevolving bag of tricks spammers use to defeat them. Because ...
199
click to vote
ACMICEC
2008
ACM
15 years 8 months ago
2008
ACM
Supply Chain Management (SCM) involves a number of interrelated activities from negotiating with suppliers to competing for customer orders and scheduling the manufacturing proces...
220
click to vote
TRECVID
2008
15 years 8 months ago
2008
In this paper we describe our TRECVID 2008 video retrieval experiments. The MediaMill team participated in three tasks: concept detection, automatic search, and interactive search...
182
click to vote
IJCAI
2003
15 years 8 months ago
2003
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...