584 search results - page 80 / 117 » Efficient mass decomposition |
WCRE
1999
IEEE
14 years 1 months ago
1999
IEEE
The software clustering problem has attracted much attention recently, since it is an integral part of the process of reverse engineering large software systems. A key problem in ...
IPPS
1996
IEEE
14 years 1 months ago
1996
IEEE
Minimizing communications when mapping affine loop nests onto distributed memory parallel computers has already drawn a lot of attention. This paper focuses on the next step: as i...
IPPS
1996
IEEE
14 years 1 months ago
1996
IEEE
A new VLSI architecture for real-time pipeline FFT processor is proposed. A hardware oriented radix-22 algorithm is derived by integrating a twiddle factor decomposition technique ...
AI
2006
Springer
14 years 20 days ago
2006
Springer
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...
CGI
2004
IEEE
14 years 20 days ago
2004
IEEE
This paper presents a new and efficient algorithm for decomposition of 3D arbitrary triangle mesh into surface patches. Our method is based on the curvature tensor field analysis ...