3250 search results - page 367 / 650 » Parameterized Learning Complexity |
148
click to vote
NAACL
2010
15 years 2 months ago
2010
Previous work on dependency parsing used various kinds of combination models but a systematic analysis and comparison of these approaches is lacking. In this paper we implemented ...
156
click to vote
JMLR
2010
14 years 11 months ago
2010
Structured prediction tasks pose a fundamental trade-off between the need for model complexity to increase predictive power and the limited computational resources for inference i...
165
click to vote
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
Modern interactive computer games provide the ability to objectively record complex human behavior, offering a variety of interesting challenges to the pattern-recognition communi...
260
click to vote
ML
2011
ACM
14 years 11 months ago
2011
ACM
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
128
click to vote
MFCS
2004
Springer
15 years 10 months ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...