Sciweavers

134 search results - page 21 / 27
» Local Minimax Learning of Approximately Polynomial Functions
Sort
View
ALT
2006
Springer
14 years 4 months ago
Learning Linearly Separable Languages
This paper presents a novel paradigm for learning languages that consists of mapping strings to an appropriate high-dimensional feature space and learning a separating hyperplane i...
Leonid Kontorovich, Corinna Cortes, Mehryar Mohri
CVPR
2008
IEEE
14 years 9 months ago
Sparse probabilistic regression for activity-independent human pose inference
Discriminative approaches to human pose inference involve mapping visual observations to articulated body configurations. Current probabilistic approaches to learn this mapping ha...
Raquel Urtasun, Trevor Darrell
ICALP
2011
Springer
12 years 11 months ago
On Tree-Constrained Matchings and Generalizations
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...
TIP
2011
255views more  TIP 2011»
13 years 2 months ago
Dictionary Learning for Stereo Image Representation
—One of the major challenges in multi-view imaging is the definition of a representation that reveals the intrinsic geometry of the visual information. Sparse image representati...
Ivana Tosic, Pascal Frossard
ICMLA
2010
13 years 5 months ago
Ensembles of Neural Networks for Robust Reinforcement Learning
Reinforcement learning algorithms that employ neural networks as function approximators have proven to be powerful tools for solving optimal control problems. However, their traini...
Alexander Hans, Steffen Udluft