2750 search results - page 37 / 550 » The complexity of learning SUBSEQ(A) |
153
click to vote
EDUTAINMENT
2006
Springer
15 years 9 months ago
2006
Springer
In this paper, we present a novel method for dynamic terrain in battlefield and an efficient plan to simulate crater in the battle. We explore a few methods for dynamic terrain sur...
191
click to vote
JMLR
2012
13 years 8 months ago
2012
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...
171
click to vote
KR
2004
Springer
15 years 11 months ago
2004
Springer
To learn to behave in highly complex domains, agents must represent and learn compact models of the world dynamics. In this paper, we present an algorithm for learning probabilist...
165
click to vote
ALT
2006
Springer
16 years 3 months ago
2006
Springer
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
191
click to vote
ICML
2006
IEEE
16 years 6 months ago
2006
IEEE
The structure of a Bayesian network (BN) encodes variable independence. Learning the structure of a BN, however, is typically of high computational complexity. In this paper, we e...