Sciweavers

126 search results - page 12 / 26
» Improved Approximation of Linear Threshold Functions
Sort
View
ICPR
2000
IEEE
14 years 11 months ago
Piecewise Linear Skeletonization Using Principal Curves
We propose an algorithm to find piecewise linear skeletons of hand-written characters by using principal curves. The development of the method was inspired by the apparent similar...
Adam Krzyzak, Balázs Kégl
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 11 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
13 years 11 months ago
Adaptive local ratio
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
Julián Mestre
ICML
2005
IEEE
14 years 10 months ago
Linear Asymmetric Classifier for cascade detectors
The detection of faces in images is fundamentally a rare event detection problem. Cascade classifiers provide an efficient computational solution, by leveraging the asymmetry in t...
Jianxin Wu, Matthew D. Mullin, James M. Rehg
GECCO
2008
Springer
131views Optimization» more  GECCO 2008»
13 years 11 months ago
Self-adaptive mutation in XCSF
Recent advances in XCS technology have shown that selfadaptive mutation can be highly useful to speed-up the evolutionary progress in XCS. Moreover, recent publications have shown...
Martin V. Butz, Patrick O. Stalph, Pier Luca Lanzi