Sciweavers

3250 search results - page 379 / 650
» Parameterized Learning Complexity
Sort
View
ICML
2010
IEEE
15 years 5 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
JMLR
2006
124views more  JMLR 2006»
15 years 4 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
JNCA
2006
114views more  JNCA 2006»
15 years 4 months ago
An evolutionary approach to prototyping pedagogical agents: from simulation to integrated system
We have developed and integrated software agents with two educational groupware systems (TeamWave Workplace and FLE), using evolutionary prototyping and empiricalbased design as d...
Anders I. Mørch, Jan A. Dolonen, Jan Eirik ...
147
Voted
TMI
2008
154views more  TMI 2008»
15 years 4 months ago
Brain Anatomical Structure Segmentation by Hybrid Discriminative/Generative Models
In this paper, a hybrid discriminative/generative model for brain anatomical structure segmentation is proposed. The learning aspect of the approach is emphasized. In the discrimin...
Zhuowen Tu, Katherine Narr, Piotr Dollár, I...
TNN
2008
138views more  TNN 2008»
15 years 4 months ago
A Fast and Scalable Recurrent Neural Network Based on Stochastic Meta Descent
This brief presents an efficient and scalable online learning algorithm for recurrent neural networks (RNNs). The approach is based on the real-time recurrent learning (RTRL) algor...
Zhenzhen Liu, Itamar Elhanany