1720 search results - page 73 / 344 » Unranking Combinations in Parallel |
PROCEDIA
2010
14 years 4 months ago
2010
Currently several computational problems require high processing power to handle huge amounts of data, although underlying core algorithms appear to be rather simple. Especially i...
163
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Aggregate measures summarizing subsets of data are valuable in exploratory analysis and decision support, especially when dependent aggregations can be easily specified and compute...
123
click to vote
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Tracking-by-detection is increasingly popular in order to tackle the visual tracking problem. Existing adaptive methods suffer from the drifting problem, since they rely on selfup...
IEEEINTERACT
2003
IEEE
15 years 3 months ago
2003
IEEE
This paper introduces a method for improving program run-time performance by gathering work in an application and executing it efficiently in an integrated thread. Our methods ext...
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...