{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T03:15:20Z","timestamp":1717470920723},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,2,11]],"date-time":"2011-02-11T00:00:00Z","timestamp":1297382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s11227-011-0570-z","type":"journal-article","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T20:19:31Z","timestamp":1297369171000},"page":"1596-1618","source":"Crossref","is-referenced-by-count":3,"title":["A distributed memory architecture implementation of\u00a0the False Nearest Neighbors method based on\u00a0distribution of dimensions"],"prefix":"10.1007","volume":"59","author":[{"given":"I.","family":"Mar\u00edn Carri\u00f3n","sequence":"first","affiliation":[]},{"given":"E.","family":"Arias Ant\u00fanez","sequence":"additional","affiliation":[]},{"given":"M. M.","family":"Artigao Castillo","sequence":"additional","affiliation":[]},{"given":"J. J.","family":"Miralles Canals","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,2,11]]},"reference":[{"key":"570_CR1","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1109\/71.841750","volume":"11","author":"I Al-furaih","year":"2000","unstructured":"Al-furaih I, Aluru S, Goil S, Ranka S (2000) Parallel construction of multidimensional binary search trees. IEEE Trans Parallel Distrib Syst 11:136\u2013148","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"570_CR2","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1998","unstructured":"Arya S, Mount DM, Netanyahu NS, Silverman R, Wu AY (1998) An optimal algorithm for approximate nearest neighbor searching. J ACM 45:891\u2013923","journal-title":"J ACM"},{"key":"570_CR3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/B978-0-444-87806-9.50011-6","volume-title":"Computational geometry","author":"T Asano","year":"1985","unstructured":"Asano T, Edahiro M, Imai H, Iri M, Murota K (1985) Practical use of bucketing techniques in computational geometry. In: Toussaint GT (ed) Computational geometry. Elsevier, Amsterdam, pp 153\u2013195"},{"key":"570_CR4","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/98524.98564","volume-title":"Proceedings of the sixth annual ACM symposium on computational geometry","author":"JL Bentley","year":"1990","unstructured":"Bentley JL (1990) K-d trees for semidynamic point sets. In: Proceedings of the sixth annual ACM symposium on computational geometry. ACM, New York, pp 187\u2013197"},{"key":"570_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational geometry: algorithms and applications","author":"M Berg De","year":"2008","unstructured":"De Berg M, Cheong O, Van Kreveld M, Overmars M (2008) Computational geometry: algorithms and applications. Springer, Berlin"},{"key":"570_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-3531-1","volume-title":"Lecture notes on bucket algorithms (Progress in computer science 6)","author":"L Devroye","year":"1986","unstructured":"Devroye L (1986) Lecture notes on bucket algorithms (Progress in computer science 6). Birkh\u00e4user, Boston"},{"key":"570_CR7","volume-title":"Introduction to parallel computing","author":"A Grama","year":"2003","unstructured":"Grama A, Gupta A, Karypis G, Kumar V (2003) Introduction to parallel computing. Pearson Education, Harlow"},{"key":"570_CR8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0375-9601(90)90577-B","volume":"148","author":"P Grassberger","year":"1990","unstructured":"Grassberger P (1990) An optimized box-assisted algorithm for fractal dimensions. Phys Lett A 148:63\u201368","journal-title":"Phys Lett A"},{"key":"570_CR9","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1142\/S0218127491000403","volume":"1","author":"P Grassberger","year":"1991","unstructured":"Grassberger P, Schreiber T, Schaffrath C (1991) Nonlinear time sequence analysis. Int J Bifurc Chaos 1:521\u2013547","journal-title":"Int J Bifurc Chaos"},{"key":"570_CR10","volume-title":"Using MPI: portable parallel programming with the message-passing interface","author":"W Gropp","year":"1999","unstructured":"Gropp W, Lusk E, Skjellum A (1999) Using MPI: portable parallel programming with the message-passing interface. MIT Press, Cambridge"},{"key":"570_CR11","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1063\/1.166424","volume":"9","author":"R Hegger","year":"1999","unstructured":"Hegger R, Kantz H, Schreiber T (1999) Practical implementation of nonlinear time series methods: The TISEAN package. Chaos 9:413\u2013435","journal-title":"Chaos"},{"key":"570_CR12","volume-title":"Nonlinear time series analysis","author":"H Kantz","year":"2004","unstructured":"Kantz H, Schreiber T (2004) Nonlinear time series analysis. Cambridge University Press, Cambridge"},{"key":"570_CR13","doi-asserted-by":"crossref","first-page":"3403","DOI":"10.1103\/PhysRevA.45.3403","volume":"45","author":"MB Kennel","year":"1992","unstructured":"Kennel MB, Brown R, Abarbanel HDI (1992) Determining embedding dimension for phase-space reconstruction using a geometrical construction. Phys Rev A 45:3403\u20133411","journal-title":"Phys Rev A"},{"key":"570_CR14","unstructured":"http:\/\/hpux.connect.org.uk\/hppd\/hpux\/Physics\/embedding-26.May.93"},{"key":"570_CR15","unstructured":"Kennel MB (2004) KDTREE Fortran 95 and C++ software to efficiently search for near neighbors in a multi-dimensional Euclidean space. arXiv: physics\/0408067"},{"key":"570_CR16","volume-title":"Kd-tree","author":"FP Miller","year":"2009","unstructured":"Miller FP, Vandome AF, McBrewster J (2009) Kd-tree. VDM Publishing House, Beau Bassin"},{"key":"570_CR17","unstructured":"Moore A (1991) An introductory tutorial on kd-trees. Technical Report No. 209 (extract from PhD. Thesis), University of Cambridge"},{"key":"570_CR18","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1103\/PhysRevLett.45.712","volume":"45","author":"NH Packard","year":"1980","unstructured":"Packard NH, Crutchfield JP, Farmer JD, Shaw RS (1980) Geometry from a time series. Phys Rev Lett 45:712\u2013716","journal-title":"Phys Rev Lett"},{"key":"570_CR19","volume-title":"Computational geometry. An introduction","author":"FP Preparata","year":"1991","unstructured":"Preparata FP, Shamos MI (1991) Computational geometry. An introduction. Springer, New York"},{"key":"570_CR20","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1142\/S0218127495000296","volume":"5","author":"T Schreiber","year":"1995","unstructured":"Schreiber T (1995) Efficient neighbor searching in nonlinear time series analysis. Int J Bifurc Chaos 5:349\u2013358","journal-title":"Int J Bifurc Chaos"},{"key":"570_CR21","volume-title":"Algorithms in C","author":"R Sedgewick","year":"2001","unstructured":"Sedgewick R (2001) Algorithms in C. Addison-Wesley, Reading"},{"key":"570_CR22","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/BFb0091924","volume-title":"Dynamical systems and turbulence, Warwick 1980","author":"F Takens","year":"1981","unstructured":"Takens F (1981) Detecting strange attractors in turbulence. In: Rand DA, Young L-S (eds) Dynamical systems and turbulence, Warwick 1980. Springer, New York, pp 366\u2013381"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-011-0570-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-011-0570-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-011-0570-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T13:39:28Z","timestamp":1560001168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-011-0570-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,11]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["570"],"URL":"https:\/\/doi.org\/10.1007\/s11227-011-0570-z","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,11]]}}}