7930 search results - page 487 / 1586 » Greedy in Approximation Algorithms |
212
click to vote
FCS
2006
15 years 8 months ago
2006
We prove an upper bound on the convergence rate of Markov Chain Monte Carlo (MCMC) algorithms for the important special case when the state space can be aggregated into a smaller ...
157
click to vote
IPCO
1996
15 years 8 months ago
1996
In recent years, approximation algorithms based on randomized rounding of fractional optimal solutions have been applied to several classes of discrete optimization problems. In t...
171
click to vote
PAMI
2008
15 years 6 months ago
2008
We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approxim...
211
click to vote
CSDA
2004
15 years 6 months ago
2004
Variable selection consists in identifying a k-subset of a set of original variables that is optimal for a given criterion of adequate approximation to the whole data set. Several...
187
click to vote
SIAMJO
2000
15 years 6 months ago
2000
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...