Sciweavers

4930 search results - page 382 / 986
» Learning minimal abstractions
Sort
View
DAGSTUHL
2009
15 years 8 months ago
Learning Highly Structured Manifolds: Harnessing the Power of SOMs
Abstract. In this paper we elaborate on the challenges of learning manifolds that have many relevant clusters, and where the clusters can have widely varying statistics. We call su...
Erzsébet Merényi, Kadim Tasdemir, Li...
ECCV
2010
Springer
15 years 7 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
INFORMATICALT
2006
88views more  INFORMATICALT 2006»
15 years 6 months ago
Improving the Performances of Asynchronous Algorithms by Combining the Nogood Processors with the Nogood Learning Techniques
Abstract. The asynchronous techniques that exist within the programming with distributed constraints are characterized by the occurrence of the nogood values during the search for ...
Ionel Muscalagiu, Vladimir Cretu
ICRA
2010
IEEE
158views Robotics» more  ICRA 2010»
15 years 5 months ago
Movement templates for learning of hitting and batting
Abstract— Hitting and batting tasks, such as tennis forehands, ping-pong strokes, or baseball batting, depend on predictions where the ball can be intercepted and how it can prop...
Jens Kober, Katharina Mülling, Oliver Kroemer...
IJCNN
2007
IEEE
16 years 1 months ago
Agnostic Learning versus Prior Knowledge in the Design of Kernel Machines
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
Gavin C. Cawley, Nicola L. C. Talbot