4843 search results - page 229 / 969 » The Shortcut Problem - Complexity and Approximation |
160
Voted
ECAI
2010
Springer
15 years 28 days ago
2010
Springer
The proposed feature selection method aims to find a minimum subset of the most informative variables for classification/regression by efficiently approximating the Markov Blanket ...
135
Voted
SIAMSC
2010
14 years 10 months ago
2010
In this paper we proposed quasi-Newton and limited memory quasi-Newton methods for objective functions defined on Grassmannians or a product of Grassmannians. Specifically we defin...
107
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
120
Voted
ARITH
2007
IEEE
15 years 7 months ago
2007
IEEE
We address the problem of computing a good floating-point-coefficient polynomial approximation to a function, with respect to the supremum norm. This is a key step in most process...
103
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...