364 search results - page 47 / 73 » Dimension Characterizations of Complexity Classes |
153
click to vote
SIAMSC
2010
14 years 9 months ago
2010
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
122
click to vote
SIAMCOMP
1998
15 years 2 months ago
1998
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
152
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
In this paper we show that the (co)chain complex associated with a decomposition of the computational domain, commonly called a mesh in computational science and engineering, can b...
111
click to vote
ML
1998
ACM
15 years 2 months ago
1998
ACM
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...
148
Voted
AVSS
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper proposes to apply optimized One-Class Support Vector Machines (1-SVMs) as a discriminative framework in order to address a specific audio classification problem. Firs...