Sciweavers

1651 search results - page 71 / 331
» Measuring the Complexity of Classification Problems
Sort
View
ESANN
2006
13 years 9 months ago
Non-linear gating network for the large scale classification model CombNET-II
The linear gating classifier (stem network) of the large scale model CombNET-II has been always the limiting factor which restricts the number of the expert classifiers (branch net...
Mauricio Kugler, Toshiyuki Miyatani, Susumu Kuroya...
ICTAI
2010
IEEE
13 years 5 months ago
Instance-Based Ensemble Pruning via Multi-Label Classification
Ensemble pruning is concerned with the reduction of the size of an ensemble prior to its combination. Its purpose is to reduce the space and time complexity of the ensemble and/or ...
Fotini Markatopoulou, Grigorios Tsoumakas, Ioannis...
MICCAI
2009
Springer
14 years 9 months ago
MKL for Robust Multi-modality AD Classification
We study the problem of classifying mild Alzheimer's disease (AD) subjects from healthy individuals (controls) using multi-modal image data, to facilitate early identification...
Chris Hinrichs, Vikas Singh, Guofan Xu, Sterlin...
CVPR
2010
IEEE
14 years 4 months ago
Curious Snakes: a minimum-latency solution to the cluttered background problem in active contours
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embe...
Ganesh Sundaramoorthi, Stefano Soatto, Anthony Yez...
FCT
2005
Springer
14 years 1 months ago
On the Black-Box Complexity of Sperner's Lemma
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...