Sciweavers

238 search results - page 15 / 48
» Learning Recursive Automata from Positive Examples
Sort
View
CVPR
2010
IEEE
14 years 4 months ago
Cascade Object Detection with Deformable Part Models
We describe a general method for building cascade classifiers from part-based deformable models such as pictorial structures. We focus primarily on the case of star-structured mod...
Pedro Felzenszwalb, Ross Girshick, David McAlleste...
JMLR
2010
136views more  JMLR 2010»
13 years 2 months ago
Reducing Label Complexity by Learning From Bags
We consider a supervised learning setting in which the main cost of learning is the number of training labels and one can obtain a single label for a bag of examples, indicating o...
Sivan Sabato, Nathan Srebro, Naftali Tishby
SEKE
2007
Springer
14 years 1 months ago
Adjudicator: A Statistical Approach for Learning Ontology Concepts from Peer Agents
— We present a statistical approach for software agents to learn ontology concepts from peer agents by asking them whether they can reach consensus on significant differences bet...
Behrouz Homayoun Far, Abdel Halim Elamy, Nora Houa...
ERSHOV
1989
Springer
13 years 11 months ago
Experiments with Implementations of Two Theoretical Constructions
This paper reports two experiments with implementations of constructions from theoretical computer science. The first one deals with Kleene’s and Rogers’ second recursion the...
Torben Amtoft Hansen, Thomas Nikolajsen, Jesper La...
ICANN
2009
Springer
14 years 3 days ago
Learning SVMs from Sloppily Labeled Data
This paper proposes a modelling of Support Vector Machine (SVM) learning to address the problem of learning with sloppy labels. In binary classification, learning with sloppy labe...
Guillaume Stempfel, Liva Ralaivola