Sciweavers

3256 search results - page 209 / 652
» Learning Linear Transformations
Sort
View
CSDA
2007
169views more  CSDA 2007»
15 years 6 months ago
A null space method for over-complete blind source separation
In blind source separation, there are M sources that produce sounds independently and continuously over time. These sounds are then recorded by m receivers. The sound recorded by ...
Ray-Bing Chen, Ying Nian Wu
BMCBI
2011
15 years 1 months ago
NClassG+: A classifier for non-classically secreted Gram-positive bacterial proteins
Background: Most predictive methods currently available for the identification of protein secretion mechanisms have focused on classically secreted proteins. In fact, only two met...
Daniel Restrepo-Montoya, Camilo Pino, Luis F. Ni&n...
ALT
2006
Springer
16 years 3 months ago
Active Learning in the Non-realizable Case
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
Matti Kääriäinen
ALT
2003
Springer
16 years 3 months ago
Intrinsic Complexity of Uniform Learning
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...
Sandra Zilles
COLT
2001
Springer
15 years 11 months ago
Robust Learning - Rich and Poor
A class C of recursive functions is called robustly learnable in the sense I (where I is any success criterion of learning) if not only C itself but even all transformed classes Î...
John Case, Sanjay Jain, Frank Stephan, Rolf Wiehag...