{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:58:36Z","timestamp":1725566316771},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540236641"},{"type":"electronic","value":"9783540304708"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30470-8_33","type":"book-chapter","created":{"date-parts":[[2010,9,23]],"date-time":"2010-09-23T21:42:15Z","timestamp":1285278135000},"page":"154-164","source":"Crossref","is-referenced-by-count":0,"title":["Large-Scale Resource Selection in Grids"],"prefix":"10.1007","author":[{"given":"Ali M.","family":"Roumani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David B.","family":"Skillicorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1993","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations. The Johns Hopkins University Press, Baltimore (1993)"},{"key":"33_CR2","unstructured":"Fayyad, U.M., Piatetsky_Shapiro, G., Smyth, P., Uthurusamy, R.: Advances in Knowledge Discovery and Data Mining. AAAI Press\/Mit Press (1996)"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T.M. Cover","year":"1967","unstructured":"Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. IEEE Trans. Inform. Theory\u00a013, 57\u201367 (1967)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"33_CR4","first-page":"57","volume":"10","author":"S. Cost","year":"1993","unstructured":"Cost, S., Salzberg, S.: A weighted nearest neighbor algorithm for learning with symbolic features. Machine Learning\u00a010, 57\u201378 (1993)","journal-title":"Machine Learning"},{"key":"33_CR5","volume-title":"Vector Quantization and Signal Compression","author":"A. Gersho","year":"1991","unstructured":"Gersho, A., Gray, R.M.: Vector Quantization and Signal Compression. Kluwer Academic, Boston (1991)"},{"key":"33_CR6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/2.410146","volume":"28","author":"M. Flickner","year":"1995","unstructured":"Flickner, M., Sawhney, H., Niblack, W., Ashley, J., Huang, Q., Dom, B., Gorkani, M., Hafner, J., Lee, D., Petkovic, D., Steele, D., Yanker, P.: Query by image and video content: The QBIC system. IEEE Computer\u00a028, 23\u201332 (1995)","journal-title":"IEEE Computer"},{"issue":"6","key":"33_CR7","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9","volume":"41","author":"S. Deerwester","year":"1990","unstructured":"Deerwester, S., Dumals, S.T., Furnas, G.W., Landauer, T.K., Harshman, R.: Indexing by latent semantic analysis. Journal of the American Society for Inform. Science\u00a041(6), 391\u2013407 (1990)","journal-title":"Journal of the American Society for Inform. Science"},{"key":"33_CR8","volume-title":"Handbook of Statistics","author":"L. Devroye","year":"1982","unstructured":"Devroye, L., Wagner, T.J.: Nearest neighbor methods in discrimination. In: Krishnaiah, P.R., Kanal, L.N. (eds.) Handbook of Statistics, vol.\u00a02, North-Holland, Amsterdam (1982)"},{"key":"33_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03427-9","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. Berg de","year":"1997","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Berlin (1997)"},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1137\/0205015","volume":"5","author":"D. Dobkin","year":"1976","unstructured":"Dobkin, D., Lipton, R.: Multidimensional search problems. SIAM J. Computing\u00a05, 181\u2013186 (1976)","journal-title":"SIAM J. Computing"},{"key":"33_CR11","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1137\/0217052","volume":"17","author":"K. Clarkson","year":"1988","unstructured":"Clarkson, K.: A randomized algorithm for closest-point queries. SIAM J. Computing\u00a017, 830\u2013847 (1988)","journal-title":"SIAM J. Computing"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Matousek, J.: Ray shooting and parametric search. In: Proc. 24th ACM Symp. On Theory of Computing, pp. 517\u2013526 (1992)","DOI":"10.1145\/129712.129763"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Yao, C., Yao, F.F.: A general approach to d-dimensional geometric queries. In: Proc. 17th Annu. Sympos. Theory Comput., pp. 163\u2013168 (1985)","DOI":"10.1145\/22145.22163"},{"key":"33_CR14","unstructured":"Matousek, J.: Reporting points in half-spaces. In: Proc. 32nd IEEE Sympos. on Foundations of Computer Science (1991)"},{"issue":"4","key":"33_CR15","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1145\/355921.355927","volume":"6","author":"J.L. Bentley","year":"1980","unstructured":"Bentley, J.L., Weide, B.W., Yao, A.C.: Optimal expected-time algorithms for closest point problems. ACM Trans. on Mathematical Software\u00a06(4), 563\u2013580 (1980)","journal-title":"ACM Trans. on Mathematical Software"},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"J.H. Friedman","year":"1977","unstructured":"Friedman, J.H., Bentley, J.L., Finkel, R.A.: An algorithm for finding best matches in logarithmic expected time. ACM Trans. on Mathematical Software\u00a03, 209\u2013226 (1977)","journal-title":"ACM Trans. on Mathematical Software"},{"key":"33_CR17","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/BF01759061","volume":"6","author":"R.F. Sproull","year":"1991","unstructured":"Sproull, R.F.: Refinements to nearest-neighbor searching in k dimensional trees. Algorithmica\u00a06, 579\u2013589 (1991)","journal-title":"Algorithmica"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Arya, S., Mount, D.M., Narayan, O.: Accounting for boundary effects in nearest neighbor searching. In: Proc. 11th Annu. ACM Sympos. Comput. Geom., pp. 336\u2013344 (1995)","DOI":"10.1145\/220279.220315"},{"key":"33_CR19","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1006\/inco.1993.1057","volume":"106","author":"S. Meiser","year":"1993","unstructured":"Meiser, S.: Point location in arrangements of hyperplanes. Information and Computation\u00a0106, 286\u2013303 (1993)","journal-title":"Information and Computation"},{"issue":"6","key":"33_CR20","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S. Arya","year":"1998","unstructured":"Arya, S., Mount, D., Netanyahu, N., Silverman, R., Wu, A.: An optimal algorithm for approximate nearest neighbor searching in fixed dimensions. Journal of the ACM\u00a045(6), 891\u2013923 (1998)","journal-title":"Journal of the ACM"},{"key":"33_CR21","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L.: An algorithm for approximate closest-point queries. In: Proc. 10th Annu. ACM Sympos. Comput. Geom., pp. 160\u2013164 (1994)","DOI":"10.1145\/177424.177609"},{"key":"33_CR22","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: Two algorithms for nearest-neighbor search in high dimensions. In: Proc. 29th ACM Sympos. on Theory of Computing (1997)","DOI":"10.1145\/258533.258653"},{"key":"33_CR23","unstructured":"Globus: A U.S. multi-institutional research effort that seeks to enable the construction of computational grids, Homepage (October 2003), http:\/\/www.globus.org\/"},{"key":"33_CR24","unstructured":"Foster, I., Kesselman, C., Lee, C., Lindell, B., Nahrstedt, K., Roy, A.: A distributed resource management architecture that supports advanced reservation and co-allocation. In: International Workshop on Quality of Service (1999)"},{"issue":"4","key":"33_CR25","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1002\/(SICI)1099-1506(199607\/08)3:4<301::AID-NLA84>3.0.CO;2-S","volume":"3","author":"M.W. Berry","year":"1996","unstructured":"Berry, M.W., Fierro, R.D.: Low-rank orthogonal decompositions for information retrieval applications. Numerical Linear Algebra with Applications\u00a03(4), 301\u2013328 (1996)","journal-title":"Numerical Linear Algebra with Applications"}],"container-title":["Lecture Notes in Computer Science","On the Move to Meaningful Internet Systems 2004: OTM 2004 Workshops"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30470-8_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:53:19Z","timestamp":1605761599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30470-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540236641","9783540304708"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30470-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}