Fast computation of sparse data cubes with constraints
β Scribed by Feng Yu-cai; Chen Chang-qing; Feng Jian-lin; Xiang Long-gang
- Publisher
- Wuhan University
- Year
- 2004
- Tongue
- English
- Weight
- 564 KB
- Volume
- 9
- Category
- Article
- ISSN
- 1007-1202
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An improved version of the "marching cubes" algorithm [W. Lorensen and H. Cline, Comp. Graph. 21, (198711 for the generation of isosurfaces from 3D data fields is presented and applied to molecular surfaces. The new algorithm avoids inconsistent pattern definitions of the original one, which lead to
## Abstract The use of atmospheric transfer functions is common in image reconstruction techniques such as speckle interferometry to calibrate the Fourier amplitudes of the reconstructed images. Thus, an accurate model is needed to ensure proper photometry in the reconstruction. The situation compl
We present a generic matrix class facility in Java and an on-going project for a runtime environment with continuous compilation aiming to support automatic parallelization of sparse computation on distributed environments. Our package comes with a collection of matrix classes with a uniform interfa