3838 search results - page 587 / 768 » Techniques for Optimization of Net Algorithms |
ALGORITHMICA
2010
14 years 10 months ago
2010
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
106
Voted
CCGRID
2011
IEEE
14 years 1 months ago
2011
IEEE
– Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data ...
PODS
2004
ACM
15 years 10 months ago
2004
ACM
Several studies have demonstrated the effectiveness of the wavelet decomposition as a tool for reducing large amounts of data down to compact wavelet synopses that can be used to ...
83
Voted
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
109
Voted
ISVC
2007
Springer
15 years 4 months ago
2007
Springer
We present a novel boosting algorithm where temporal consistency is addressed in a short-term way. Although temporal correlation of observed data may be an important cue for classi...