3250 search results - page 260 / 650 » Parameterized Learning Complexity |
180
click to vote
ICDAR
2005
IEEE
15 years 12 months ago
2005
IEEE
In this paper, we study different methods for prototype selection for recognizing handwritten characters of Tamil script. In the first method, cumulative pairwise- distances of th...
174
click to vote
ICDAR
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we propose a novel method of building a language model for open-vocabulary Korean word recognition. Due to the complex morphology of Korean, it is inappropriate to ...
146
click to vote
ICRA
2003
IEEE
15 years 11 months ago
2003
IEEE
We present an approach that uses Q-learning on individual robotic agents, for coordinating a missiontasked team of robots in a complex scenario. To reduce the size of the state sp...
151
Voted
PKDD
2000
Springer
15 years 10 months ago
2000
Springer
Previous algoritms for the construction of belief networks structures from data are mainly based either on independence criteria or on scoring metrics. The aim of this paper is to ...
157
click to vote
EMNLP
2007
15 years 7 months ago
2007
Deterministic parsing has emerged as an effective alternative for complex parsing algorithms which search the entire search space to get the best probable parse tree. In this pape...