Sciweavers

499 search results - page 35 / 100
» Multilevel algorithms for linear ordering problems
Sort
View
ALGORITHMICA
2011
13 years 4 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro
ML
2002
ACM
141views Machine Learning» more  ML 2002»
13 years 8 months ago
On the Existence of Linear Weak Learners and Applications to Boosting
We consider the existence of a linear weak learner for boosting algorithms. A weak learner for binary classification problems is required to achieve a weighted empirical error on t...
Shie Mannor, Ron Meir
SIGIR
2006
ACM
14 years 3 months ago
Large scale semi-supervised linear SVMs
Large scale learning is often realistic only in a semi-supervised setting where a small set of labeled examples is available together with a large collection of unlabeled data. In...
Vikas Sindhwani, S. Sathiya Keerthi
ICASSP
2011
IEEE
13 years 25 days ago
Feature selection through gravitational search algorithm
In this paper we deal with the problem of feature selection by introducing a new approach based on Gravitational Search Algorithm (GSA). The proposed algorithm combines the optimi...
João Paulo Papa, Andre Pagnin, Silvana Arti...
ESANN
2008
13 years 10 months ago
Learning Data Representations with Sparse Coding Neural Gas
Abstract. We consider the problem of learning an unknown (overcomplete) basis from an unknown sparse linear combination. Introducing the "sparse coding neural gas" algori...
Kai Labusch, Erhardt Barth, Thomas Martinetz