Sciweavers

849 search results - page 79 / 170
» Learning to Solve Problems from Exercises
Sort
View
CVPR
2008
IEEE
15 years 12 months ago
Transfer learning for image classification with sparse prototype representations
To learn a new visual category from few examples, prior knowledge from unlabeled data as well as previous related categories may be useful. We develop a new method for transfer le...
Ariadna Quattoni, Michael Collins, Trevor Darrell
IJCAI
2007
14 years 11 months ago
Using Learned Policies in Heuristic-Search Planning
Many current state-of-the-art planners rely on forward heuristic search. The success of such search typically depends on heuristic distance-to-the-goal estimates derived from the ...
Sung Wook Yoon, Alan Fern, Robert Givan
FOCS
2009
IEEE
14 years 7 months ago
Learning and Smoothed Analysis
We give a new model of learning motivated by smoothed analysis (Spielman and Teng, 2001). In this model, we analyze two new algorithms, for PAC-learning DNFs and agnostically learn...
Adam Tauman Kalai, Alex Samorodnitsky, Shang-Hua T...
ECCV
2010
Springer
14 years 10 months ago
MIForests: Multiple-Instance Learning with Randomized Trees
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
Christian Leistner, Amir Saffari, Horst Bischof
IROS
2006
IEEE
165views Robotics» more  IROS 2006»
15 years 3 months ago
Learning Relational Navigation Policies
— Navigation is one of the fundamental tasks for a mobile robot. The majority of path planning approaches has been designed to entirely solve the given problem from scratch given...
Alexandru Cocora, Kristian Kersting, Christian Pla...