Computational and Memory Complexities of Greengard-Rokhlin's Fast Multipole Algorithm.

Norimasa Nakashima Mitsuo Tateiba

Published in: IEICE Trans. Electron. (2005)

Keyphrases

times faster
data sets
expectation maximization
classification algorithm
ant colony optimization
memory space
memory usage
randomly generated
memory requirements
parallel algorithm
path planning
graph cuts
worst case
dynamic programming
cost function
data structure
objective function
learning algorithm