3341 search results - page 132 / 669 » On Bounded Queries and Approximation |
101
click to vote
NIPS
2001
14 years 11 months ago
2001
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
MOC
2000
14 years 9 months ago
2000
In the approximation of linear elliptic operators in mixed form, it is well known that the so-called inf-sup and ellipticity in the kernel properties are sufficient (and, in a sens...
JMLR
2006
14 years 10 months ago
2006
The eigenvalues of the kernel matrix play an important role in a number of kernel methods, in particular, in kernel principal component analysis. It is well known that the eigenva...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
In this paper, we first present an outer bound for a general interference channel with a cognitive relay, i.e., a relay that has non-causal knowledge of both independent messages t...
CRYPTO
2005
Springer
15 years 3 months ago
2005
Springer
We present an improved bound on the advantage of any q-query adversary at distinguishing between the CBC MAC over a random n-bit permutation and a random function outputting n bit...