10608 search results - page 292 / 2122 » Complexity of O'Hara's Algorithm |
102
click to vote
APCCAS
2006
IEEE
15 years 2 months ago
2006
IEEE
- In this paper, the grouped scheme is specially applied to compute the fast Fourier transform (FFT) when the portions of transformed outputs are calculated selectively. The groupe...
128
click to vote
PR
2008
15 years 17 days ago
2008
7 Linear discriminant analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled p...
JCP
2007
15 years 15 days ago
2007
— This work presents a mathematical framework for the development of efficient algorithms for cyclic convolution computations. The framework is based on the Chinese Reminder Theo...
180
click to vote
GIS
2009
ACM
16 years 1 months ago
2009
ACM
A common problem in moving object databases (MOD) is the reconstruction of a trajectory from a trajectory sample (i.e., a finite sequence of time-space points). A typical solution...
112
click to vote
STOC
2006
ACM
16 years 28 days ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...