Sciweavers

13603 search results - page 276 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
PPL
2010
118views more  PPL 2010»
15 years 5 months ago
Coping with Decoherence: Parallelizing the Quantum Fourier Transform
Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a fu...
Marius Nagy, Selim G. Akl
CHI
2006
ACM
16 years 7 months ago
Non-visual overviews of complex data sets
Johan Kildal, Stephen A. Brewster
AAAI
2008
15 years 9 months ago
Fast Spectral Learning using Lanczos Eigenspace Projections
The core computational step in spectral learning
Sridhar Mahadevan