Sciweavers

2750 search results - page 232 / 550
» The complexity of learning SUBSEQ(A)
Sort
View
GECCO
2005
Springer
220views Optimization» more  GECCO 2005»
16 years 7 days ago
Scale invariant pareto optimality: a meta--formalism for characterizing and modeling cooperativity in evolutionary systems
This article describes a mathematical framework for characterizing cooperativity in complex systems subject to evolutionary pressures. This framework uses three foundational compo...
Mark Fleischer
PAMI
2007
210views more  PAMI 2007»
15 years 6 months ago
Sharing Visual Features for Multiclass and Multiview Object Detection
We consider the problem of detecting a large number of different classes of objects in cluttered scenes. Traditional approaches require applying a battery of different classifier...
Antonio Torralba, Kevin P. Murphy, William T. Free...
ICML
2007
IEEE
16 years 7 months ago
Gradient boosting for kernelized output spaces
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...
Florence d'Alché-Buc, Louis Wehenkel, Pierr...
ICALT
2008
IEEE
16 years 1 months ago
A Framework for Semantic Group Formation
Collaboration has long been considered an effective approach to learning. However, forming optimal groups can be a time consuming and complex task. Different approaches have been ...
Asma Ounnas, Hugh C. Davis, David E. Millard
IJCNN
2007
IEEE
16 years 1 months ago
Optimizing 0/1 Loss for Perceptrons by Random Coordinate Descent
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...
Ling Li, Hsuan-Tien Lin