Sciweavers

11151 search results - page 132 / 2231
» On the Complexity of Model Expansion
Sort
View
ICML
2007
IEEE
16 years 5 months ago
A bound on the label complexity of agnostic active learning
We study the label complexity of pool-based active learning in the agnostic PAC model. Specifically, we derive general bounds on the number of label requests made by the A2 algori...
Steve Hanneke
88
Voted
MODELS
2009
Springer
15 years 11 months ago
Abstracting Complex Languages through Transformation and Composition
ing Complex Languages through Transformation and Composition Jendrik Johannes, Steffen Zschaler, Miguel A. Fernández, Antonio Castillo, Dimitrios S. Kolovos and Richard F. Paige ...
Jendrik Johannes, Steffen Zschaler, Miguel A. Fern...
CORR
2008
Springer
104views Education» more  CORR 2008»
15 years 4 months ago
New bounds on classical and quantum one-way communication complexity
In this paper we provide new bounds on classical and quantum distributional communication complexity in the two-party, one-way model of communication. In the classical one-way mode...
Rahul Jain, Shengyu Zhang
133
Voted
ECTEL
2007
Springer
15 years 10 months ago
Integration in Generic Tool Learning Design to Support Complex Learning Methodologies
: Current learning modelling languages do not allow formalization of scripts where generic tools are required. This limitation is especially relevant on remote courses when using c...
Luis de la Fuente Valentín
164
Voted
IDA
2009
Springer
15 years 11 months ago
Probabilistic Formulation of Independent Vector Analysis Using Complex Gaussian Scale Mixtures
We propose a probabilistic model for the Independent Vector Analysis approach to blind deconvolution and derive an asymptotic Newton method to estimate the model by Maximum Likelih...
Jason A. Palmer, Kenneth Kreutz-Delgado, Scott Mak...