Sciweavers

1416 search results - page 147 / 284
» The Kernel Least-Mean-Square Algorithm
Sort
View
124
Voted
CORR
2010
Springer
128views Education» more  CORR 2010»
15 years 3 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
171
Voted
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
13 years 6 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
109
Voted
FPL
2007
Springer
94views Hardware» more  FPL 2007»
15 years 10 months ago
A Many-core Implementation based on the Reconfigurable Mesh Model
The reconfigurable mesh is a model for massively parallel computing for which many algorithms with very low complexity have been developed. These algorithms execute cycles of bus...
Heiner Giefers, Marco Platzner
128
Voted
INFORMATICASI
2002
91views more  INFORMATICASI 2002»
15 years 3 months ago
Using Image Segmentation as a Basis for Categorization
Image categorization is the problem of classifying images into one or more of several possible categories or classes, which are defined in advance. Classifiers can be trained usin...
Janez Brank
138
Voted
GECCO
2009
Springer
167views Optimization» more  GECCO 2009»
15 years 10 months ago
Fixed-parameter evolutionary algorithms and the vertex cover problem
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Stefan Kratsch, Frank Neumann