4843 search results - page 232 / 969 » The Shortcut Problem - Complexity and Approximation |
151
click to vote
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
140
Voted
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
118
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We consider multiple description (MD) coding for the Gaussian source with K descriptions under the symmetric meansquared error (MSE) distortion constraints, and provide an approxim...
154
click to vote
MCS
2008
Springer
15 years 3 months ago
2008
Springer
In this paper we propose a numerical method for approximating the product of a matrix function with multiple vectors by Krylov subspace methods combined with a QR decomposition of...
140
Voted
IJFCS
2002
15 years 3 months ago
2002
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...