Efficient Algorithm of Computing the Shortest Distance of Massive Points Based on Probability and Statistics Model

Abstract:

Article Preview

Through adopting probability and statistics model in the process of computing shortest distance, partition strategy can solve the low efficiency of traditional algorithm. Theoretically the time complexity could be reduced to O(N). In this article main algorithms are provided and the factors of affecting algorithms efficiency are also discussed. Finally put forward some applications of the algorithms in our life and research.

Info:

Periodical:

Advanced Materials Research (Volumes 268-270)

Edited by:

Feng Xiong

Pages:

1462-1465

DOI:

10.4028/www.scientific.net/AMR.268-270.1462

Citation:

J. Q. Deng and J. Zhang, "Efficient Algorithm of Computing the Shortest Distance of Massive Points Based on Probability and Statistics Model", Advanced Materials Research, Vols. 268-270, pp. 1462-1465, 2011

Online since:

July 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.