{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T04:37:42Z","timestamp":1648701462207},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,5,26]],"date-time":"2011-05-26T00:00:00Z","timestamp":1306368000000},"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,9]]},"DOI":"10.1007\/s11227-011-0618-0","type":"journal-article","created":{"date-parts":[[2011,5,25]],"date-time":"2011-05-25T10:41:22Z","timestamp":1306320082000},"page":"572-589","source":"Crossref","is-referenced-by-count":2,"title":["Approximative distance computation by random hashing"],"prefix":"10.1007","volume":"61","author":[{"given":"Selim","family":"Mimaroglu","sequence":"first","affiliation":[]},{"given":"Murat","family":"Yagci","sequence":"additional","affiliation":[]},{"given":"Dan A.","family":"Simovici","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,5,26]]},"reference":[{"key":"618_CR1","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/276698.276876","volume-title":"Proceedings of the thirtieth annual ACM symposium on theory of computing","author":"P Indyk","year":"1998","unstructured":"Indyk P, Motwani R (1998) Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the thirtieth annual ACM symposium on theory of computing, pp\u00a0604\u2013613"},{"issue":"1","key":"618_CR2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A Andoni","year":"2008","unstructured":"Andoni A, Indyk P (2008) Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun ACM 51(1):117\u2013122","journal-title":"Commun ACM"},{"key":"618_CR3","first-page":"518","volume-title":"Proceedings of the 25th international conference on very large data bases","author":"A Gionis","year":"1999","unstructured":"Gionis A, Indyk P, Motwani R (1999) Similarity search in high dimensions via hashing. In: Proceedings of the 25th international conference on very large data bases, pp\u00a0518\u2013529"},{"key":"618_CR4","first-page":"134","volume-title":"WebDB (informal proceedings)","author":"T Haveliwala","year":"2000","unstructured":"Haveliwala T, Gionis A, Indyk P (2000) Scalable techniques for clustering the web. In: WebDB (informal proceedings), vol\u00a0129, p 134"},{"issue":"1","key":"618_CR5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10115-006-0027-5","volume":"12","author":"H Koga","year":"2007","unstructured":"Koga H, Ishibashi T, Watanabe T (2007) Fast agglomerative hierarchical clustering algorithm using locality-sensitive hashing. Knowl Inf Syst 12(1):25\u201353","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"618_CR6","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1093\/comjnl\/16.1.30","volume":"16","author":"R Sibson","year":"1973","unstructured":"Sibson R (1973) Slink: an optimally efficient algorithm for the single-link cluster method. Comput J 16(1):30\u201334","journal-title":"Comput J"},{"issue":"9","key":"618_CR7","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1109\/TC.1972.5009071","volume":"21","author":"M Flynn","year":"1972","unstructured":"Flynn M (1972) Some computer organizations and their effectiveness. IEEE Trans Comput 21(9):948\u2013960","journal-title":"IEEE Trans Comput"},{"key":"618_CR8","first-page":"714","volume-title":"DMIN","author":"S Mimaroglu","year":"2008","unstructured":"Mimaroglu S, Simovici DA (2008) Approximate computation of object distances by locality-sensitive hashing. In: DMIN, pp 714\u2013718"},{"key":"618_CR9","first-page":"266","volume-title":"Lecture notes in computer science, vol\u00a04192","author":"P Kambadur","year":"2006","unstructured":"Kambadur P, Gregor D, Lumsdaine A, Dharurkar A (2006) Modernizing the C++ interface to mpi. In: Lecture notes in computer science, vol\u00a04192. Springer, Berlin, p\u00a0266"},{"key":"618_CR10","first-page":"1","volume-title":"IPDPS","author":"W Tansey","year":"2008","unstructured":"Tansey W, Tilevich E (2008) Efficient automated marshaling of C++ data structures for mpi applications. In: IPDPS. IEEE Press, New York, pp\u00a01\u201312"},{"issue":"1","key":"618_CR11","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1177\/1094342005051521","volume":"19","author":"R Thakur","year":"2005","unstructured":"Thakur R, Rabenseifner R, Gropp W (2005) Optimization of collective communication operations in mpich. Int J High Perform Comput Appl 19(1):49","journal-title":"Int J High Perform Comput Appl"},{"key":"618_CR12","first-page":"245","volume-title":"Lecture notes in computer science","author":"I Dhillon","year":"2000","unstructured":"Dhillon I, Modha DS (2000) A data-clustering algorithm on distributed memory multiprocessors. In: Lecture notes in computer science, vol 1759. Springer, Berlin, pp\u00a0245\u2013260"},{"key":"618_CR13","unstructured":"Gropp W, Huss-Lederman S, Lumsdaine A, Lusk E, Nitzberg B, Saphir W, Snir M (1998) Mpi\u2014the complete reference, vol\u00a02, The mpi-2 extensions. ISBN-10:0-262-57123-4"},{"key":"618_CR14","author":"B Tu","year":"2009","unstructured":"Tu B, Fan J, Zhan J, Zhao X (2009) Performance analysis and optimization of MPI collective operations on multi-core clusters. J Supercomput. doi: 10.1007\/s11227-009-0296-3","journal-title":"J Supercomput."},{"key":"618_CR15","first-page":"7","volume-title":"Lecture notes in computer science","author":"W Gropp","year":"2002","unstructured":"Gropp W (2002) Mpich2: a\u00a0new start for mpi implementations. In: Lecture notes in computer science. Springer, Berlin, pp 7\u201327"},{"key":"618_CR16","volume-title":"Beyond the C++ standard library","author":"B Karlsson","year":"2005","unstructured":"Karlsson B (2005) Beyond the C++ standard library. Addison-Wesley Professional, New York"},{"issue":"1","key":"618_CR17","first-page":"30","volume":"11","author":"R Sokal","year":"1962","unstructured":"Sokal R, Rohlf F (1962) The comparison of dendrograms by objective methods. Taxon 11(1):30\u201340","journal-title":"Taxon"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-011-0618-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-011-0618-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-011-0618-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:24:04Z","timestamp":1559384644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-011-0618-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,26]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["618"],"URL":"https:\/\/doi.org\/10.1007\/s11227-011-0618-0","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,26]]}}}