Sciweavers

346 search results - page 17 / 70
» A New Approximate Maximal Margin Classification Algorithm
Sort
View
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 7 months ago
Sublinear Optimization for Machine Learning
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
ICCV
2009
IEEE
15 years 15 days ago
Patch based Within-Object Classification
Advances in object detection have made it possible to collect large databases of certain objects. In this paper we exploit these datasets for within-object classification. For e...
Jania Aghajanian, Jonathan Warrell, Simon J.D. Pri...
SIAMJO
2010
89views more  SIAMJO 2010»
13 years 2 months ago
A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
Necessary first-order sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. These conditions are sati...
Roberto Andreani, José Mario Martíne...
JMIV
2002
72views more  JMIV 2002»
13 years 7 months ago
Estimating Overcomplete Independent Component Bases for Image Windows
Estimating overcomplete ICA bases for image windows is a difficult problem. Most algorithms require the estimation of values of the independent components which leads to computatio...
Aapo Hyvärinen, Mika Inki
CATS
2006
13 years 9 months ago
On the Approximability of Maximum and Minimum Edge Clique Partition Problems
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...