![Analysis of algorithms / Randomized algorithm / Big O notation / Time complexity / Expectation–maximization algorithm / Pseudo-random number sampling / Theoretical computer science / Mathematics / Applied mathematics Analysis of algorithms / Randomized algorithm / Big O notation / Time complexity / Expectation–maximization algorithm / Pseudo-random number sampling / Theoretical computer science / Mathematics / Applied mathematics](https://www.pdfsearch.io/img/fd4d2c3402bc5d9e26e7ef817d4f8b72.jpg)
| Document Date: 2005-10-15 23:23:14 Open Document File Size: 1,44 MBShare Result on Facebook
City Providence / / Company IBM / Mathematical Software / / Currency pence / USD / / Facility Brown University / / IndustryTerm reservoir algorithms / statistical software / faster algorithm / e-y / reservoir algorithm / basic algorithm / theoretical results and show that Algorithm / / Organization National Science Foundation / Brown University / Department of Computer Science / Association for Computing Machinery / / Person Alan Waterman / JEFFREY SCOTT VITTER / / Position Author / General / / ProgrammingLanguage R / FORTRAN 77 / Pascal / / ProvinceOrState Rhode Island / / PublishedMedium The CPU times / / Technology reservoir algorithms / reservoir algorithm / describing reservoir algorithms / much faster algorithm / RESERVOIR ALGORITHMS AND ALGORITHM / random access / Statistics-probabilistic algorithms / basic algorithm / OPTIMIZING ALGORITHM / /
SocialTag |