2750 search results - page 58 / 550 » The complexity of learning SUBSEQ(A) |
152
click to vote
AIPS
2008
15 years 8 months ago
2008
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
182
click to vote
NIPS
2008
15 years 7 months ago
2008
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
168
click to vote
LWA
2007
15 years 7 months ago
2007
Serious games that should adapt training to the individual might benefit from methods that are developed for intelligent tutoring systems. One method, model tracing, might be used...
177
click to vote
DAGM
2010
Springer
15 years 6 months ago
2010
Springer
The selection of an optical flow method is mostly a choice from among accuracy, efficiency and ease of implementation. While variational approaches tend to be more accurate than lo...
143
click to vote
NIPS
2007
15 years 7 months ago
2007
We present a simple, agnostic active learning algorithm that works for any hypothesis class of bounded VC dimension, and any data distribution. Our algorithm extends a scheme of C...