3250 search results - page 284 / 650 » Parameterized Learning Complexity |
176
Voted
COLT
2003
Springer
15 years 10 months ago
2003
Springer
The application of statistical methods to natural language processing has been remarkably successful over the past two decades. But, to deal with recent problems arising in this ï¬...
130
Voted
ILP
1998
Springer
15 years 9 months ago
1998
Springer
This paper describes a new kind of language bias, S-structural indeterminate clauses, which takes into account the meaning of predicates that play a key role in the complexity of l...
129
click to vote
CIDM
2007
IEEE
15 years 9 months ago
2007
IEEE
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
153
click to vote
ECML
2006
Springer
15 years 8 months ago
2006
Springer
Multiple-instance learning (MIL) is a popular concept among the AI community to support supervised learning applications in situations where only incomplete knowledge is available....
126
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Learning goal-scoring behaviour from scratch for simulated robot soccer is considered to be a very difficult problem, and is often achieved by endowing players with an innate set ...