4930 search results - page 605 / 986 » Learning minimal abstractions |
204
click to vote
IJCAI
2007
15 years 8 months ago
2007
Given sensors to detect object use, commonsense priors of object usage in activities can reduce the need for labeled data in learning activity models. It is often useful, however,...
206
click to vote
NIPS
2008
15 years 8 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...
220
click to vote
NIPS
2008
15 years 8 months ago
2008
Covariance estimation for high dimensional vectors is a classically difficult problem in statistical analysis and machine learning. In this paper, we propose a maximum likelihood ...
167
click to vote
NIPS
2007
15 years 8 months ago
2007
Rosetta is one of the leading algorithms for protein structure prediction today. It is a Monte Carlo energy minimization method requiring many random restarts to find structures ...
154
click to vote
AAAI
2006
15 years 8 months ago
2006
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...