Sciweavers

129 search results - page 17 / 26
» Learning DFA from Simple Examples
Sort
View
CVPR
2007
IEEE
16 years 1 months ago
Fast Terrain Classification Using Variable-Length Representation for Autonomous Navigation
We propose a method for learning using a set of feature representations which retrieve different amounts of information at different costs. The goal is to create a more efficient ...
Anelia Angelova, Larry Matthies, Daniel M. Helmick...
94
Voted
IJON
2006
109views more  IJON 2006»
14 years 11 months ago
Associative memory of connectivity patterns
The goal of the visual correspondence problem is to establish a connectivity pattern (a mapping) between two images such that features projected from the same scene point are conn...
Junmei Zhu, Christoph von der Malsburg
COGSCI
2002
108views more  COGSCI 2002»
14 years 11 months ago
Statistical models for the induction and use of selectional preferences
Selectional preferences have a long history in both generative and computational linguistics. However, since the publication of Resnik's dissertation in 1993, a new approach ...
Marc Light, Warren R. Greiff
ISNN
2007
Springer
15 years 5 months ago
Neural Networks Training with Optimal Bounded Ellipsoid Algorithm
Abstract. Compared to normal learning algorithms, for example backpropagation, the optimal bounded ellipsoid (OBE) algorithm has some better properties, such as faster convergence,...
José de Jesús Rubio, Wen Yu
74
Voted
ATAL
2005
Springer
15 years 5 months ago
On possibilistic case-based reasoning for selecting partners for multi-attribute agent negotiation
We propose an enhanced mechanism for selecting partners for multi-attribute negotiation. The mechanism employs possibilistic case-based reasoning. The possibility of successful ne...
Jakub Brzostowski, Ryszard Kowalczyk