Sciweavers

3250 search results - page 394 / 650
» Parameterized Learning Complexity
Sort
View
AROBOTS
2004
99views more  AROBOTS 2004»
15 years 4 months ago
Bayesian Robot Programming
We propose a new method to program robots based on Bayesian inference and learning. It is called BRP for Bayesian Robot Programming. The capacities of this programming method are d...
Olivier Lebeltel, Pierre Bessière, Julien D...
AICOM
2000
105views more  AICOM 2000»
15 years 4 months ago
Emergence of Vowel Systems Through Self-Organisation
This paper describes a model of the emergence and the universal structural tendencies of vowel systems. Both are considered as the result of self-organisation in a population of l...
Bart de Boer
COLING
2002
15 years 4 months ago
Fine Grained Classification of Named Entities
While Named Entity extraction is useful in many natural language applications, the coarse categories that most NE extractors work with prove insufficient for complex applications ...
Michael Fleischman, Eduard H. Hovy
129
Voted
IJCV
2000
97views more  IJCV 2000»
15 years 4 months ago
Contour Tracking in Clutter: A Subset Approach
A new method for tracking contours of moving objects in clutter is presented. For a given object, a model of its contours is learned from training data in the form of a subset of c...
Daniel Freedman, Michael S. Brandstein
NECO
2010
129views more  NECO 2010»
15 years 2 months ago
A Two-Layer Model of Natural Stimuli Estimated with Score Matching
We consider a hierarchical two-layer model of natural signals in which both layers are learned from the data. Estimation is accomplished by Score Matching, a recently proposed est...
Urs Köster, Aapo Hyvärinen