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

Article Preview

Abstract:

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.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 268-270)

Pages:

1462-1465

Citation:

Online since:

July 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Yan weimin, Wu weimin. Data Structure[M]. Beijing: Tsinghua University Press, 1997: 190-191.

Google Scholar

[2] Gong guanglu. Probability Theory and Mathematical Statistics[M] . Beijing: Tsinghua University Press, 2006: 167-170.

Google Scholar

[3] Jerry Cardiff , Christopher . Windows Core Programming [M]. Beijing: Tsinghua University Press, 2008: 387-390.

Google Scholar

[4] Chen xiangqun, Xiang yong, Wang lei, Ma hongbin , Dava Probert . Windows Principle of Operating System [M]. Beijing: China Machine Press, 2004: 124-139.

Google Scholar

[5] Randal E. Bryant, David R. O'Hallaron. Computer Systems: A Programmer's Perspective[M]. Beijing: Electronic Industry Press, 2006: 601-605.

Google Scholar