Home
Publications
Talks
Teaching
Contact
Light
Dark
Automatic
kernel
Apprentissage de classifieurs sous contraintes probabilité
Batch and online approaches for constrained classificatio: Neyman-Pearson and q-value classification.
Apr 7, 2011 10:40 AM
Slides
Multitask learning using Non-convex Sparsity Regularization
Multitask learning using Non-convex Sparsity Regularization with application to BCI
May 26, 2009 2:00 PM
Slides
Cite
×