{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:17:52Z","timestamp":1760707072975},"reference-count":12,"publisher":"Elsevier BV","issue":"3-6","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematics and Computers in Simulation"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0378-4754(02)00252-5","type":"journal-article","created":{"date-parts":[[2003,3,4]],"date-time":"2003-03-04T16:29:22Z","timestamp":1046795362000},"page":"289-295","source":"Crossref","is-referenced-by-count":7,"title":["Parallel Monte Carlo algorithms for information retrieval"],"prefix":"10.1016","volume":"62","author":[{"given":"V.N.","family":"Alexandrov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.T.","family":"Dimov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Karaivanova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.J.K.","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0378-4754(02)00252-5_BIB1","unstructured":"A. Athanasopoulos, Information retrieval and singular value computations, M.Sc. Dissertation, Department of Computer Science, University of Liverpool, 2000."},{"key":"10.1016\/S0378-4754(02)00252-5_BIB2","doi-asserted-by":"crossref","unstructured":"M.W. Berry, Z. Drmac, E.R. Jessup, Matrices, vector spaces, and information retrieval, SIAM Rev. 41 (2) (1999) 335\u2013362.","DOI":"10.1137\/S0036144598347035"},{"key":"10.1016\/S0378-4754(02)00252-5_BIB3","doi-asserted-by":"crossref","unstructured":"Y.V. Bulavskii, Randomized method of successive approximations for solving systems of linear algebraic equations, Russ. J. Numer. Anal. Math. Model. 10 (6) (1995) 481\u2013493.","DOI":"10.1515\/rnam.1995.10.6.481"},{"key":"10.1016\/S0378-4754(02)00252-5_BIB4","doi-asserted-by":"crossref","unstructured":"J.K. Cullum, R.A. Willoughby, Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Birkhauser, Basel, 1985.","DOI":"10.1007\/978-1-4684-9178-4"},{"key":"10.1016\/S0378-4754(02)00252-5_BIB5","doi-asserted-by":"crossref","unstructured":"S. Deerwester, S.T. Dumais, T.K. Landauer, G.W. Furnas, Indexing by latent semantic analysis, J. Am. Soc. Inform. Sci. 41 (1990) 391\u2013407.","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9"},{"key":"10.1016\/S0378-4754(02)00252-5_BIB6","doi-asserted-by":"crossref","unstructured":"I. Dimov, V. Alexandrov, A. Karaivanova, Implementation of Monte Carlo algorithms for eigenvalue problem using MPI, in: Lecture Notes in Computer Science, vol. 147, Springer, Berlin, 1998, pp. 346\u2013353.","DOI":"10.1007\/BFb0056594"},{"key":"10.1016\/S0378-4754(02)00252-5_BIB7","unstructured":"S.K. Godunov, A.G. Antonov, O.P. Kiriljum, V.I. Kostin, Guaranteed Accuracy in Numerical Linear Algebra, Kluwer Academic Publishers, Dordrecht, 1988."},{"key":"10.1016\/S0378-4754(02)00252-5_BIB8","unstructured":"G.H. Golub, C.F. Van Loan, Matrix Computations, John Hopkins University Press, Baltimore, MD, 1996."},{"key":"10.1016\/S0378-4754(02)00252-5_BIB9","doi-asserted-by":"crossref","unstructured":"R. Lehoucq, D. Sorensen, C. Yang, ARPACK Users\u2019 Guide: Solution of Large Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods, Department of Computational and Applied Mathematics, Rice University, USA, 1997.","DOI":"10.1137\/1.9780898719628"},{"key":"10.1016\/S0378-4754(02)00252-5_BIB10","doi-asserted-by":"crossref","unstructured":"N. Ramakrishnan, A.Y. Grama, Data mining: from serendipity to science, IEEE Comput. 32 (8) (1999) 34\u201337.","DOI":"10.1109\/2.781632"},{"key":"10.1016\/S0378-4754(02)00252-5_BIB11","doi-asserted-by":"crossref","unstructured":"C.J.K. Tan, J.A.R. Blais, PLFG: a highly scalable parallel pseudo-random number generator for Monte Carlo simulations, in: M. Bubak, et al. (Eds.), LNCS, vol. 1823, Springer, Berlin, 2000.","DOI":"10.1007\/3-540-45492-6_14"},{"key":"10.1016\/S0378-4754(02)00252-5_BIB12","doi-asserted-by":"crossref","unstructured":"H. Zha, O. Marques, H.D. Simon, Large-scale SVD and subspace based methods for information retrieval, in: A. Ferreira, J. Rolim, H. Simon, S.-H. Teng (Eds.), Proceedings of the 5th International Symposium on Solving Irregularly Structured Problems in Parallel, Springer, Berlin, 1998.","DOI":"10.1007\/BFb0018525"}],"container-title":["Mathematics and Computers in Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0378475402002525?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0378475402002525?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T14:25:20Z","timestamp":1584023120000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0378475402002525"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":12,"journal-issue":{"issue":"3-6","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0378475402002525"],"URL":"https:\/\/doi.org\/10.1016\/s0378-4754(02)00252-5","relation":{},"ISSN":["0378-4754"],"issn-type":[{"value":"0378-4754","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}