2570 search results - page 2 / 514 » Fast Algorithms For The Computation Of Ranklets |
CORR
2011
Springer
13 years 23 days ago
2011
Springer
COLING
2010
13 years 23 days ago
2010
Sentence-level aligned parallel texts are important resources for a number of natural language processing (NLP) tasks and applications such as statistical machine translation and ...
MOC
1998
13 years 5 months ago
1998
Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))N j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk, then P...
CANS
2011
Springer
12 years 5 months ago
2011
Springer
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
PAMI
2010
13 years 4 months ago
2010
— This paper proposes a fast algorithm for Walsh Hadamard Transform on sliding windows which can be used to implement pattern matching most efficiently. The computational require...