3875 search results - page 202 / 775 » Approximation algorithms for the 0-extension problem |
170
click to vote
IR
2010
15 years 4 months ago
2010
Abstract Most ranking algorithms are based on the optimization of some loss functions, such as the pairwise loss. However, these loss functions are often different from the criter...
200
click to vote
JMLR
2010
15 years 4 months ago
2010
A large number of learning algorithms, for example, spectral clustering, kernel Principal Components Analysis and many manifold methods are based on estimating eigenvalues and eig...
165
click to vote
PPSN
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The paper describes an evolutionary algorithm for the general nonlinear programming problem using a surrogate model. Surrogate models are used in optimization when model ...
164
click to vote
ICIP
2005
IEEE
16 years 7 months ago
2005
IEEE
In this paper the blind deconvolution problem is formulated using the variational framework. With its use approximations of the involved probability distributions are developed re...
151
click to vote
ECML
2004
Springer
15 years 11 months ago
2004
Springer
HEXQ is a reinforcement learning algorithm that discovers hierarchical structure automatically. The generated task hierarchy repthe problem at different levels of abstraction. In ...