Sciweavers

2750 search results - page 224 / 550
» The complexity of learning SUBSEQ(A)
Sort
View
CIG
2005
IEEE
16 years 26 days ago
A Generic Approach for Generating Interesting Interactive Pac-Man Opponents
This paper follows on from our previous work focused on formulating an efficient generic measure of user’s satisfaction (‘interest’) when playing predator/prey games. Viewin...
Georgios N. Yannakakis, John Hallam
ICDM
2005
IEEE
118views Data Mining» more  ICDM 2005»
16 years 26 days ago
A Heterogeneous Field Matching Method for Record Linkage
Record linkage is the process of determining that two records refer to the same entity. A key subprocess is evaluating how well the individual fields, or attributes, of the recor...
Steven Minton, Claude Nanjo, Craig A. Knoblock, Ma...
KNINVI
2005
Springer
16 years 22 days ago
Digital Concept Maps for Managing Knowledge and Information
Abstract. Due to the increasing amount and complexity of knowledge and information in many domains, students who self-regulate their study in e-learning scenarios often suffer from...
Sigmar-Olaf Tergan
COLT
2000
Springer
15 years 11 months ago
PAC Analogues of Perceptron and Winnow via Boosting the Margin
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
Rocco A. Servedio
HIS
2004
15 years 8 months ago
Adaptive Boosting with Leader based Learners for Classification of Large Handwritten Data
Boosting is a general method for improving the accuracy of a learning algorithm. AdaBoost, short form for Adaptive Boosting method, consists of repeated use of a weak or a base le...
T. Ravindra Babu, M. Narasimha Murty, Vijay K. Agr...