Sciweavers

2969 search results - page 280 / 594
» A space efficient algorithm for group structure computation
Sort
View
QCQC
1998
Springer
173views Communications» more  QCQC 1998»
15 years 8 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
JUCS
2010
150views more  JUCS 2010»
15 years 2 months ago
SOM Clustering to Promote Interoperability of Directory Metadata: A Grid-Enabled Genetic Algorithm Approach
: Directories provide a general mechanism for describing resources and enabling information sharing within and across organizations. Directories must resolve differing structures a...
Lei Li, Vijay K. Vaishnavi, Art Vandenberg
CG
2004
Springer
15 years 4 months ago
Occlusion Culling in OpenSG PLUS
Very large polygonal models are frequently used in scientific computing, mechanical engineering, or virtual medicine. An effective technique to handle these large models is occlus...
Dirk Staneker, Dirk Bartz, Wolfgang Straßer
ADC
2010
Springer
204views Database» more  ADC 2010»
14 years 11 months ago
Systematic clustering method for l-diversity model
Nowadays privacy becomes a major concern and many research efforts have been dedicated to the development of privacy protecting technology. Anonymization techniques provide an eff...
Md. Enamul Kabir, Hua Wang, Elisa Bertino, Yunxian...
ATAL
2010
Springer
14 years 11 months ago
Approximate dynamic programming with affine ADDs
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
Scott Sanner, William T. B. Uther, Karina Valdivia...