Sciweavers

1997 search results - page 348 / 400
» On the convergence of Hill's method
Sort
View
102
Voted
MOR
2006
81views more  MOR 2006»
15 years 1 months ago
Simulated Annealing for Convex Optimization
We apply the method known as simulated annealing to the following problem in convex optimization: minimize a linear function over an arbitrary convex set, where the convex set is ...
Adam Tauman Kalai, Santosh Vempala
PAA
2008
15 years 1 months ago
Online nonparametric discriminant analysis for incremental subspace learning and recognition
This paper presents a novel approach for online subspace learning based on an incremental version of the nonparametric discriminant analysis (NDA). For many real-world applications...
Bogdan Raducanu, Jordi Vitrià
PR
2008
85views more  PR 2008»
15 years 1 months ago
Quadratic boosting
This paper presents a strategy to improve the AdaBoost algorithm with a quadratic combination of base classifiers. We observe that learning this combination is necessary to get be...
Thang V. Pham, Arnold W. M. Smeulders
105
Voted
NETWORK
2006
109views more  NETWORK 2006»
15 years 1 months ago
Can DiffServ guarantee IP QoS under failures?
As ISPs and telcos converge toward all-IP network infrastructures, the problem of service reliability becomes more acute. In this article, we investigate to what extent DiffServ c...
Brunilde Sansò, Christian Awad, André...
98
Voted
PR
2008
131views more  PR 2008»
15 years 1 months ago
A memetic algorithm for evolutionary prototype selection: A scaling up approach
Prototype selection problem consists of reducing the size of databases by removing samples that are considered noisy or not influential on nearest neighbour classification tasks. ...
Salvador García, José Ramón C...