3250 search results - page 159 / 650 » Parameterized Learning Complexity |
144
click to vote
NAACL
2003
15 years 7 months ago
2003
We describe a simple unsupervised technique for learning morphology by identifying hubs in an automaton. For our purposes, a hub is a node in a graph with in-degree greater than o...
149
click to vote
IVC
2000
15 years 6 months ago
2000
Rule-based systems employed to model complex object behaviours, do not necessarily provide a realistic portrayal of true behaviour. To capture the real characteristics in a specif...
155
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
We present a new algorithm for learning a convex set in n-dimensional space given labeled examples drawn from any Gaussian distribution. The complexity of the algorithm is bounded ...
197
click to vote
AGI
2011
14 years 10 months ago
2011
We present an actor-critic scheme for reinforcement learning in complex domains. The main contribution is to show that planning and I/O dynamics can be separated such that an intra...
163
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Object detection can be challenging when the object class exhibits large variations. One commonly-used strategy is to first partition the space of possible object variations and t...