6142 search results - page 128 / 1229 » The Complexity of Partition Functions |
200
click to vote
JMLR
2010
15 years 1 months ago
2010
We address an approximation method for Gaussian process (GP) regression, where we approximate covariance by a block matrix such that diagonal blocks are calculated exactly while o...
163
click to vote
TNN
2008
15 years 6 months ago
2008
In this paper, we use complex analytic functions to achieve independent component analysis (ICA) by maximization of non-Gaussianity and introduce the complex maximization of nonGau...
167
click to vote
EVOW
2004
Springer
15 years 11 months ago
2004
Springer
In sequential, deterministic, non-redundant search the algorithm permutes a test function to obtain the search result. The mapping from test functions to search results is a one-to...
168
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
140
click to vote
FOCS
1991
IEEE
15 years 9 months ago
1991
IEEE
Karchmer, Raz, and Wigderson, 1991, discuss the circuit depth complexity of n bit Boolean functions constructed by composing up to d = logn=loglogn levels of k = logn bit boolean