Sciweavers

2080 search results - page 390 / 416
» Measuring empirical computational complexity
Sort
View
201
Voted
QCQC
1998
Springer
173views Communications» more  QCQC 1998»
15 years 9 months ago
Quantum Wavelet Transforms: Fast Algorithms and Complete Circuits
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classi...
Amir Fijany, Colin P. Williams
SIGGRAPH
2010
ACM
15 years 8 months ago
FASTCD: fracturing-aware stable collision detection
We present a collision detection (CD) method for complex and large-scale fracturing models that have geometric and topological changes. We first propose a novel dual-cone culling...
Jae-Pil Heo, Duksu Kim, Joon-Kyung Seong, Jeong-Mo...
CCGRID
2001
IEEE
15 years 8 months ago
Group Communication in Differentiated Services Networks
The Differentiated Services (DiffServ) approach will also bring benefits for multicast applications which need quality of service support. For instance, a highly reliable multicas...
Roland Bless, Klaus Wehrle
CASES
2005
ACM
15 years 7 months ago
Energy management for commodity short-bit-width microcontrollers
Dynamic frequency scaling and dynamic voltage scaling have been developed to save power and/or energy for general purpose computing platforms and high-end embedded systems. This p...
Rony Ghattas, Alexander G. Dean
DAC
2008
ACM
15 years 6 months ago
DeMOR: decentralized model order reduction of linear networks with massive ports
Model order reduction is an efficient technique to reduce the system complexity while producing a good approximation of the input-output behavior. However, the efficiency of reduc...
Boyuan Yan, Lingfei Zhou, Sheldon X.-D. Tan, Jie C...