Sciweavers

421 search results - page 38 / 85
» Reducing Label Complexity by Learning From Bags
Sort
View
IJAC
2007
116views more  IJAC 2007»
14 years 9 months ago
On the Complexity of the Whitehead Minimization Problem
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
Abdó Roig, Enric Ventura, Pascal Weil
IJRR
2010
214views more  IJRR 2010»
14 years 7 months ago
Object Recognition in 3D Point Clouds Using Web Data and Domain Adaptation
Over the last years, object detection has become a more and more active field of research in robotics. An important problem in object detection is the need for sufficient labeled ...
Kevin Lai, Dieter Fox
JMLR
2012
13 years 4 days ago
Transductive Learning of Structural SVMs via Prior Knowledge Constraints
Reducing the number of labeled examples required to learn accurate prediction models is an important problem in structured output prediction. In this paper we propose a new transd...
Chun-Nam Yu
99
Voted
EMNLP
2007
14 years 11 months ago
A Discriminative Learning Model for Coordinate Conjunctions
We propose a sequence-alignment based method for detecting and disambiguating coordinate conjunctions. In this method, averaged perceptron learning is used to adapt the substituti...
Masashi Shimbo, Kazuo Hara
81
Voted
PKDD
2009
Springer
181views Data Mining» more  PKDD 2009»
15 years 4 months ago
Active Learning for Reward Estimation in Inverse Reinforcement Learning
Abstract. Inverse reinforcement learning addresses the general problem of recovering a reward function from samples of a policy provided by an expert/demonstrator. In this paper, w...
Manuel Lopes, Francisco S. Melo, Luis Montesano