메뉴 건너뛰기




Volumn , Issue , 2012, Pages 463-483

Multitree Algorithms for Large-Scale Astrostatistics

Author keywords

[No Author keywords available]

Indexed keywords


EID: 85081813856     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter
Times cited : (1)

References (35)
  • 1
    • 84899027721 scopus 로고    scopus 로고
    • N-body problems in statistical learning
    • T. K. Leen, T. G. Dietterich, V. Tresp (eds), Dec, MIT Press, Cambridge, MA, 2000
    • A. Gray, A. W. Moore, 2001. N-body problems in statistical learning, in: T. K. Leen, T. G. Dietterich, V. Tresp (eds), Advances in Neural Information Processing Systems 13 (Dec 2000), MIT Press, Cambridge, MA.
    • (2001) Advances in Neural Information Processing Systems , vol.13
    • Gray, A.1    Moore, A.W.2
  • 2
    • 84945709355 scopus 로고
    • An algorithm for finding best matches in logarithmic expected time
    • J. H. Friedman, J. L. Bentley, R. A. Finkel, 1977. An algorithm for finding best matches in logarithmic expected time, ACM Trans. Math. Softw. 3(3), 209-226.
    • (1977) ACM Trans. Math. Softw. , vol.3 , Issue.3 , pp. 209-226
    • Friedman, J.H.1    Bentley, J.L.2    Finkel, R.A.3
  • 3
    • 0013111818 scopus 로고
    • Technical Report TR-89-063, International Computer Science Institute
    • S. M. Omohundro, 1989. Five balltree construction algorithms, Technical Report TR-89-063, International Computer Science Institute.
    • (1989) Five balltree construction algorithms
    • Omohundro, S.M.1
  • 4
    • 0021644214 scopus 로고
    • The quadtree and related hierarchical data structures
    • H. Samet, 1984. The quadtree and related hierarchical data structures, ACM Comput. Surv. 16(2), 187-260.
    • (1984) ACM Comput. Surv. , vol.16 , Issue.2 , pp. 187-260
    • Samet, H.1
  • 7
    • 70350674995 scopus 로고
    • On the shortest spanning subtree of a graph and the traveling salesman problem
    • J. B. Kruskal, 1956. On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Am. Math. Soc. 7, 48-50.
    • (1956) Proc. Am. Math. Soc. , vol.7 , pp. 48-50
    • Kruskal, J.B.1
  • 8
    • 84911584312 scopus 로고
    • Shortest connection networks and some generalizations
    • R. C. Prim, 1957. Shortest connection networks and some generalizations, Bell Syst. Tech. J. 36, 1389-1401.
    • (1957) Bell Syst. Tech. J. , vol.36 , pp. 1389-1401
    • Prim, R.C.1
  • 9
    • 0035962186 scopus 로고    scopus 로고
    • Otakar Boruvka on the minimum spanning tree problem
    • J. Nesetril, 2001. Otakar Boruvka on the minimum spanning tree problem, DiscreteMath. 233, 3-36.
    • (2001) DiscreteMath. , vol.233 , pp. 3-36
    • Nesetril, J.1
  • 12
    • 12044250154 scopus 로고
    • Bias and variance of angular correlation functions
    • S. Landy, A. Szalay, 1993. Bias and variance of angular correlation functions, Astrophys. J. 412, 64-71.
    • (1993) Astrophys. J. , vol.412 , pp. 64-71
    • Landy, S.1    Szalay, A.2
  • 13
    • 0000396658 scopus 로고
    • A fast algorithm for particle simulations
    • L. Greengard, V. Rokhlin, 1987. A fast algorithm for particle simulations, J. Computat. Phys. 73, 325-248.
    • (1987) J. Computat. Phys. , vol.73 , pp. 248-325
    • Greengard, L.1    Rokhlin, V.2
  • 14
    • 84864053767 scopus 로고    scopus 로고
    • Dual-tree fast Gauss transforms
    • Y. Weiss, B. Schölkopf, J. Platt (eds), MIT Press, Cambridge, MA
    • D. Lee, A. G. Gray, A.W. Moore, 2006. Dual-tree fast Gauss transforms, in:Y. Weiss, B. Schölkopf, J. Platt (eds), Advances inNeural Information Processing Systems 18, MIT Press, Cambridge, MA, pp. 747-754.
    • (2006) Advances inNeural Information Processing Systems 18 , pp. 747-754
    • Lee, D.1    Gray, A.G.2    Moore, A.W.3
  • 19
    • 10044252413 scopus 로고    scopus 로고
    • Nonparametric density estimation: Toward computational tractability
    • San Francisco, CA
    • A. G. Gray, A. W. Moore, 2003. Nonparametric density estimation: Toward computational tractability, in: SIAM International Conference on Data Mining (SDM), San Francisco, CA, vol. 3.
    • (2003) SIAM International Conference on Data Mining (SDM) , vol.3
    • Gray, A.G.1    Moore, A.W.2
  • 21
    • 84864053767 scopus 로고    scopus 로고
    • Dual-tree fast Gauss transforms
    • Y. Weiss, B. Schölkopf, J. Platt (eds), MIT Press, Cambridge, MA
    • D. Lee, A. Gray, A. Moore, Dual-tree fast Gauss transforms, in: Y. Weiss, B. Schölkopf, J. Platt (eds), 2006. Advances in Neural Information Processing Systems 18, MIT Press, Cambridge, MA, pp. 747-754.
    • (2006) Advances in Neural Information Processing Systems , vol.18 , pp. 747-754
    • Lee, D.1    Gray, A.2    Moore, A.3
  • 23
    • 0002439750 scopus 로고
    • An efficient program for many-body simulation
    • A. Appel, 1985. An efficient program for many-body simulation, SIAM J. Sci. Statist. Comput. 6, 85.
    • (1985) SIAM J. Sci. Statist. Comput. , vol.6 , pp. 85
    • Appel, A.1
  • 25
    • 85138371797 scopus 로고    scopus 로고
    • Rank-approximate nearest neighbor search: Retaining meaning and speed in high dimensions
    • Dec, MIT Press 2009
    • P. Ram, D. Lee, H. Ouyang, A. G. Gray, 2010. Rank-approximate nearest neighbor search:Retaining meaning and speed in high dimensions, in:Advances inNeural Information Processing Systems (NIPS) 22 (Dec 2009), MIT Press.
    • (2010) Advances inNeural Information Processing Systems (NIPS) , vol.22
    • Ram, P.1    Lee, D.2    Ouyang, H.3    Gray, A.G.4
  • 26
    • 84863368604 scopus 로고    scopus 로고
    • Fast high-dimensional kernel summations using the Monte Carlo multipole method
    • Dec, MIT Press, 2008
    • D. Lee, A. G. Gray, 2009. Fast high-dimensional kernel summations using the Monte Carlo multipole method, in:Advances inNeural Information Processing Systems (NIPS) 21 (Dec 2008), MIT Press.
    • (2009) Advances inNeural Information Processing Systems (NIPS) , vol.21
    • Lee, D.1    Gray, A.G.2
  • 28
    • 12844274488 scopus 로고    scopus 로고
    • Breakthrough of the year: Illuminating the dark universe
    • C. Seife, 2003. Breakthrough of the year: Illuminating the dark universe, Science 302 (5653), 2017-2172.
    • (2003) Science , vol.302 , Issue.5653 , pp. 2017-2172
    • Seife, C.1
  • 30
    • 34250637009 scopus 로고    scopus 로고
    • The three-point correlation function of luminous red galaxies in the Sloan digital sky survey
    • G. Kulkarni, R. Nichol, R. Sheth, H. Seo, D. Eisenstein, A. G. Gray, 2007. The three-point correlation function of luminous red galaxies in the Sloan digital sky survey, MNRAS 378, 1196-1206.
    • (2007) MNRAS , vol.378 , pp. 1196-1206
    • Kulkarni, G.1    Nichol, R.2    Sheth, R.3    Seo, H.4    Eisenstein, D.5    Gray, A.G.6
  • 31
    • 1642309426 scopus 로고    scopus 로고
    • Galaxy ecology: Groups and low-density environments in the SDSS and 2dFGRS
    • M. Balogh, V. Eke, C. Miller, I. Lewis, R. Bower, W. Couch, R. Nichol, et al. 2004. Galaxy ecology:Groups and low-density environments in the SDSS and 2dFGRS, MNRAS, 348, 257-269.
    • (2004) MNRAS , vol.348 , pp. 257-269
    • Balogh, M.1    Eke, V.2    Miller, C.3    Lewis, I.4    Bower, R.5    Couch, W.6    Nichol, R.7
  • 32
    • 19944433801 scopus 로고    scopus 로고
    • Efficient photometric selection of quasars from the Sloan Digital Sky Survey: 100, 000 z < 3 quasars from data release one
    • G. Richards, R. Nichol, A. G. Gray, R. Brunner, R. Lupton, D. Vanden Berk, S. Chong et al. 2004. Efficient photometric selection of quasars from the Sloan Digital Sky Survey: 100, 000 z < 3 quasars from data release one, ApJS 155, 257-269.
    • (2004) ApJS , vol.155 , pp. 257-269
    • Richards, G.1    Nichol, R.2    Gray, A.G.3    Brunner, R.4    Lupton, R.5    Vanden Berk, D.6    Chong, S.7
  • 34
    • 52649109154 scopus 로고    scopus 로고
    • Quasars reveal cosmic magnification
    • M. Peplow, 2005. Quasars reveal cosmic magnification, Nature, doi:10.1038/news050425-2.
    • (2005) Nature
    • Peplow, M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.