Sciweavers

10901 search results - page 98 / 2181
» Approximations in Distributed Optimization
Sort
View
ICML
2003
IEEE
16 years 7 months ago
Optimizing Classifier Performance via an Approximation to the Wilcoxon-Mann-Whitney Statistic
When the goal is to achieve the best correct classification rate, cross entropy and mean squared error are typical cost functions used to optimize classifier performance. However,...
Lian Yan, Robert H. Dodier, Michael Mozer, Richard...
ICALP
2005
Springer
15 years 11 months ago
Optimal Spaced Seeds for Faster Approximate String Matching
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
Martin Farach-Colton, Gad M. Landau, Süleyman...
PLILP
1993
Springer
15 years 10 months ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...
STOC
2012
ACM
209views Algorithms» more  STOC 2012»
13 years 8 months ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...
MP
2002
176views more  MP 2002»
15 years 6 months ago
UOBYQA: unconstrained optimization by quadratic approximation
UOBYQA is a new algorithm for general unconstrained optimization calculations, that takes account of the curvature of the objective function, F say, by forming quadratic models by ...
M. J. D. Powell