Sciweavers

123 search results - page 23 / 25
» Multi-information Ensemble Diversity
Sort
View
IRMA
2000
13 years 7 months ago
Recognizing bounds of context change in on-line learning
The on-line algorithms in machine learning are intended to discover unknown function of the domain based on incremental observing of it instance by instance. These algorithms have...
Helen Kaikova, Vagan Y. Terziyan, Borys Omelayenko
SIAMREV
2010
174views more  SIAMREV 2010»
13 years 1 months ago
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the ...
Benjamin Recht, Maryam Fazel, Pablo A. Parrilo
NAR
2011
256views Computer Vision» more  NAR 2011»
12 years 9 months ago
COSMIC: mining complete cancer genomes in the Catalogue of Somatic Mutations in Cancer
COSMIC (http://www.sanger.ac.uk/cosmic) curates comprehensive information on somatic mutations in human cancer. Release v48 (July 2010) describes over 136 000 coding mutations in ...
Simon A. Forbes, Nidhi Bindal, Sally Bamford, Char...
BMCBI
2010
138views more  BMCBI 2010»
13 years 6 months ago
Amino acid classification based spectrum kernel fusion for protein subnuclear localization
Background: Prediction of protein localization in subnuclear organelles is more challenging than general protein subcelluar localization. There are only three computational models...
Suyu Mei, Wang Fei
AAAI
2004
13 years 7 months ago
Analogical Path Planning
We present a probabilistic method for path planning that considers trajectories constrained by both the environment and an ensemble of restrictions or preferences on preferred mot...
Saul Simhon, Gregory Dudek