Sciweavers

263 search results - page 38 / 53
» Splitting of Learnable Classes
Sort
View
CORR
2011
Springer
261views Education» more  CORR 2011»
13 years 3 months ago
Convex and Network Flow Optimization for Structured Sparsity
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
STOC
2006
ACM
159views Algorithms» more  STOC 2006»
14 years 9 months ago
Learning a circuit by injecting values
d Abstract] Dana Angluin James Aspnes Jiang Chen Yinghua Wu We propose a new model for exact learning of acyclic circuits using experiments in which chosen values may be assigned ...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu
SAGA
2001
Springer
14 years 1 months ago
Stochastic Finite Learning
Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to potential ap...
Thomas Zeugmann
ECCV
1994
Springer
14 years 23 days ago
Integration and Control of Reactive Visual Processes
This paper describes a new approach to the integration and control of continuously operating visual processes. Visual processes are expressed as transformations which map signals ...
James L. Crowley, Jean Marc Bedrune, Morten Bekker...
IJCAI
1989
13 years 9 months ago
A Critique of the Valiant Model
This paper considers the Valiant framework as it is applied to the task of learning logical concepts from random examples. It is argued that the current interpretation of this Val...
Wray L. Buntine