Filters








22,659 Hits in 5.5 sec

Pseudo-random number generation for sketch-based estimations

Florin Rusu, Alin Dobra
<span title="2007-06-01">2007</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ahla23r2jva2bp2hlkt5rtbx4y" style="color: black;">ACM Transactions on Database Systems</a> </i> &nbsp;
The performance of sketches depends crucially on the ability to generate particular pseudo-random numbers.  ...  In this article we investigate both theoretically and empirically the problem of generating k-wise independent pseudorandom numbers and, in particular, that of generating 3-and 4-wise independent pseudo-random  ...  The evaluation procedure is based on 100 experiments that use a number of randomly generated intervals, and an equal number of sketches chosen for each method such that the overall running time is in the  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1242524.1242528">doi:10.1145/1242524.1242528</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sv4ig6tktfamxk7tcsc3ndykf4">fatcat:sv4ig6tktfamxk7tcsc3ndykf4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811004005/https://www.cise.ufl.edu/~frusu/Papers/tods-2007-06.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2a/36/2a365b450f8610a25d32b966612dcf0359b39a72.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1242524.1242528"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Towards Optimal Cardinality Estimation of Unions and Intersections with Sketches

Daniel Ting
<span title="">2016</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fqqihtxlu5bvfaqxjyvqcob35a" style="color: black;">Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD &#39;16</a> </i> &nbsp;
Large data applications often require the use of approximate methods based on small sketches of the data.  ...  We give new estimators for the cardinality of unions and intersection and show they approximate an optimal estimation procedure.  ...  Given sets A1, A2 and a random universal hash, MinCount generates random sketches S1, S2 of sizes k1, k2 respectively.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2939672.2939772">doi:10.1145/2939672.2939772</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/kdd/Ting16.html">dblp:conf/kdd/Ting16</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ibwm4p4jybdhxi3mduqhcosruu">fatcat:ibwm4p4jybdhxi3mduqhcosruu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160823173419/http://www.kdd.org:80/kdd2016/papers/files/rfp0467-tingA.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0f/af/0fafd84369d00c2ec7d3261145c188811dc9e675.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2939672.2939772"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A statistical analysis of probabilistic counting algorithms [article]

Peter Clifford, Ioana A. Cosma
<span title="2010-11-07">2010</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We present a statistical analysis of probabilistic counting algorithms, focusing on two techniques that use pseudo-random variates to form low-dimensional data sketches.  ...  We apply conventional statistical methods to compare probabilistic algorithms based on storing either selected order statistics, or random projections.  ...  Acknowledgement The authors would like to thank Professor Steffen Lauritzen for insightful discussions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0801.3552v3">arXiv:0801.3552v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yhf6wknoofcphkwkxvqsw3eguq">fatcat:yhf6wknoofcphkwkxvqsw3eguq</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-0801.3552/0801.3552.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0801.3552v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Pseudo-Deterministic Streaming

Shafi Goldwasser, Ofer Grossman, Sidhanth Mohanty, David P. Woodruff, Michael Wagner
<span title="2020-01-10">2020</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cjckxhgqp5dobfucnrxpxnsy4u" style="color: black;">Innovations in Theoretical Computer Science</a> </i> &nbsp;
sketching algorithm for 2 norm estimation.  ...  A pseudo-deterministic algorithm is a (randomized) algorithm which, when run multiple times on the same input, with high probability outputs the same result on all executions.  ...  Since V T is given by a deterministic function of A, and the output of the algorithm V is equal to V T with high probability, our algorithm is pseudo-deterministic.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.itcs.2020.79">doi:10.4230/lipics.itcs.2020.79</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/innovations/GoldwasserGMW20.html">dblp:conf/innovations/GoldwasserGMW20</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kmjkxzxwlfgermvmnwxbizubsu">fatcat:kmjkxzxwlfgermvmnwxbizubsu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201213193016/https://drops.dagstuhl.de/opus/volltexte/2020/11764/pdf/LIPIcs-ITCS-2020-79.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/42/7f/427f5c093c33646436edc308fd2c4fa29548ec0d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.itcs.2020.79"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Pseudo-deterministic Streaming [article]

Shafi Goldwasser, Ofer Grossman, Sidhanth Mohanty, David P. Woodruff
<span title="2019-11-26">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
sketching algorithm for ℓ_2 norm estimation.  ...  A pseudo-deterministic algorithm is a (randomized) algorithm which, when run multiple times on the same input, with high probability outputs the same result on all executions.  ...  Sketching lower bounds for pseudo-deterministic ℓ 2 norm estimation: The known randomized algorithms (such as [AMS99] ) for approximating the ℓ 2 norm of a vector x in a stream rely on sketching, i.e.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1911.11368v1">arXiv:1911.11368v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ogsz743pmzhx7bmrryvagxkddu">fatcat:ogsz743pmzhx7bmrryvagxkddu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200928190425/https://arxiv.org/pdf/1911.11368v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/86/1e/861e072152fc099120bd4f15483378541251a0b5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1911.11368v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

A resource-minimalist flow size histogram estimator

Bruno Ribeiro, Tao Ye, Don Towsley
<span title="">2008</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ojfzbasykngz3ensk2j2k3fcbi" style="color: black;">Proceedings of the 8th ACM SIGCOMM conference on Internet measurement conference - IMC &#39;08</a> </i> &nbsp;
Existing algorithms compute fine grained estimates for each flow size, i.e. 1, 2,. . . up to the maximum number observed over a finite time interval.  ...  in coarse grained estimates of larger flow sizes.  ...  Pseudo-random auxiliary counters: We use O(log W ) auxiliary counters to implement random sampling for flow counters in the sketch.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1452520.1452553">doi:10.1145/1452520.1452553</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/imc/RibeiroYT08.html">dblp:conf/imc/RibeiroYT08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hrbymrqa75cctlyhtbhp7zrgrq">fatcat:hrbymrqa75cctlyhtbhp7zrgrq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150116125041/http://www.cs.cmu.edu:80/~ribeiro/pdf/ribeiro_imc2008.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b0/03/b0035785cf75ee9e9d9c18db70b516d73336c0a6.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1452520.1452553"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Fast-MUSIC for Automotive Massive-MIMO Radar [article]

Bin Li, Shuseng Wang, Jun Zhang, Xainbin Cao, Chenglin Zhao
<span title="2020-07-20">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
By leveraging randomized low-rank approximation, our fast-MUSIC approaches, relying on random sampling and projection techniques, would speed up the subspace computation by orders of magnitude.  ...  At the same time, we establish the theoretical bounds of our proposed approaches, which ensure the accuracy of approximated pseudo-spectrum.  ...  Compared with the random sampling based sketch in Algorithm 1, such a random projection based sketch should incorporate more information of S and thus permits a more accurate approximation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1911.07434v2">arXiv:1911.07434v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/e3hcftoxhfabbmobe7z2maqk4i">fatcat:e3hcftoxhfabbmobe7z2maqk4i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826220403/https://arxiv.org/pdf/1911.07434v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/87/86/8786f8b56760f735a7ec5ff1cfd53717de4b0cf5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1911.07434v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Monte Carlo Computation of the Fisher Information Matrix in Nonstandard Settings

James C Spall
<span title="">2005</span> <i title="Informa UK Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/uuo44cjltzg2flanabrks3a5fi" style="color: black;">Journal of Computational And Graphical Statistics</a> </i> &nbsp;
The resampling-based method relies on an efficient technique for estimating the Hessian matrix, introduced as part of the adaptive ("second-order") form of the simultaneous perturbation stochastic approximation  ...  for Bayesian analysis.  ...  ARNs represent Monte Carlo-generated random numbers such that various pairs of random numbers are negatively correlated.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1198/106186005x78800">doi:10.1198/106186005x78800</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/do6tcuxjujdfxhhd73inwjx2bq">fatcat:do6tcuxjujdfxhhd73inwjx2bq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180721163807/http://www.jhuapl.edu/SPSA/PDF-SPSA/Spall_JCGS05_000.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f9/d0/f9d0784c7d49ce281d1b8f93159cf1048bd54080.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1198/106186005x78800"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Sketch-Based Multi-Query Processing over Data Streams [chapter]

Alin Dobra, Minos Garofalakis, Johannes Gehrke, Rajeev Rastogi
<span title="">2016</span> <i title="Springer Berlin Heidelberg"> Data-Centric Systems and Applications </i> &nbsp;
Randomized techniques, based on computing small "sketch" synopses for each stream, have recently been shown to be a very effective tool for approximating the result of a single SQL query over streaming  ...  We provide necessary and sufficient conditions for multi-query sketch sharing that guarantee the correctness of the result-estimation process.  ...  The synopses of choice for a number of the above-cited papers are based on the key idea of pseudo-random sketches which, essentially, can be thought of as simple, randomized linear projections of the underlying  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-28608-0_12">doi:10.1007/978-3-540-28608-0_12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pikysomhbbbhrhnqhzfbec7xy4">fatcat:pikysomhbbbhrhnqhzfbec7xy4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060919160628/http://www.cs.cornell.edu/johannes/papers/2004/edbt2004-mqo.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7b/1e/7b1e4a2aa36e097bbef82e208347c6fa9169f381.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-28608-0_12"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Sketch-Based Multi-query Processing over Data Streams [chapter]

Alin Dobra, Minos Garofalakis, Johannes Gehrke, Rajeev Rastogi
<span title="">2004</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Randomized techniques, based on computing small "sketch" synopses for each stream, have recently been shown to be a very effective tool for approximating the result of a single SQL query over streaming  ...  We provide necessary and sufficient conditions for multi-query sketch sharing that guarantee the correctness of the result-estimation process.  ...  The synopses of choice for a number of the above-cited papers are based on the key idea of pseudo-random sketches which, essentially, can be thought of as simple, randomized linear projections of the underlying  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-24741-8_32">doi:10.1007/978-3-540-24741-8_32</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/e2ts6l3xmzhidj7cmoooyz2fo4">fatcat:e2ts6l3xmzhidj7cmoooyz2fo4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060919160628/http://www.cs.cornell.edu/johannes/papers/2004/edbt2004-mqo.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7b/1e/7b1e4a2aa36e097bbef82e208347c6fa9169f381.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-24741-8_32"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Fast Randomized-MUSIC for mm-Wave Massive MIMO Radars [article]

Li Bin and Wang Shuseng and Zhang Jun and Cao Xianbin and Zhao Chenglin
<span title="2021-01-11">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this work, we develop a fast randomized-MUSIC (R-MUSIC) algorithm, which exploits the random matrix sketching to estimate the signal subspace via approximated computation.  ...  Moreover, the accuracy of R-MUSIC suffers no degradation unlike others low-complexity counterparts, i.e. the high-resolution angle of arrival (AoA) estimation is attained.  ...  CONCLUSION Relying on a novel concept of randomized matrix sketching, the computational efficient estimation of signal subspace is studied for high resolution massive MIMO radars.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2101.04570v1">arXiv:2101.04570v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vx7lvlluybfhvdqgdvw5xxljny">fatcat:vx7lvlluybfhvdqgdvw5xxljny</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210118101518/https://arxiv.org/pdf/2101.04570v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5c/5f/5c5f30627a11fa67694aa0174b629dcd2e3098ca.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2101.04570v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Stable Distributions in Streaming Computations [chapter]

Graham Cormode, Piotr Indyk
<span title="">2016</span> <i title="Springer Berlin Heidelberg"> Data-Centric Systems and Applications </i> &nbsp;
Then for each new tuple (i, c), we initialize a pseudo-random number generator with the index i (line 4), so that when we draw random values (lines 6-7), these are pseudo-random functions of i, the same  ...  In practice, it suffices to use standard random number generators to generate uniform pseudo-random numbers, and use the transforms given in the previous section.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-28608-0_14">doi:10.1007/978-3-540-28608-0_14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/d7cc4svc5beh5o3ckts46scdyu">fatcat:d7cc4svc5beh5o3ckts46scdyu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808205914/http://dimacs.rutgers.edu/~graham//pubs/papers/stablechapter.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/29/35/2935138db8cd796a79588b267be7a512d1032688.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-28608-0_14"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Page 1245 of Mathematical Reviews Vol. 21, Issue 11 [page]

<span title="">1960</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Pseudo-random elements for computers. Appl. Statist. 8 (1959), 124-131. An expository paper which reviews procedures for generating pseudo observations within a digital computer.  ...  Empirical tests of an additive random number generator. J. Assoc. Comput. Mach. 6 (1959), 527-537. 1245  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1960-11_21_11/page/1245" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1960-11_21_11/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Learning from Synthetic Animals [article]

Jiteng Mu, Weichao Qiu, Gregory Hager, Alan Yuille
<span title="2020-04-05">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Without using any real image label, our method allows for accurate keypoint prediction on real images.  ...  In this paper, we use synthetic images and ground truth generated from CAD animal models to address this challenge.  ...  The authors would like to thank Chunyu Wang, Qingfu Wan, Yi Zhang for helpful discussions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1912.08265v2">arXiv:1912.08265v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/y4ykhdv5afbdjpbscstblyvrqy">fatcat:y4ykhdv5afbdjpbscstblyvrqy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200408001137/https://arxiv.org/pdf/1912.08265v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1912.08265v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints [chapter]

Yoram Bachrach, Ely Porat
<span title="">2013</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
A key building block for collaborative filtering recommender systems is finding users with similar consumption patterns.  ...  However, for massive recommender systems such a naive approach requires a high running time and may be intractable in terms of the space required to store the full data.  ...  We focus on estimating the similarity between users (see [28] for a survey of methods for generating recommendations based on similarity information).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-39212-2_41">doi:10.1007/978-3-642-39212-2_41</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/x777tsaroraxzaa77qxznlr5ei">fatcat:x777tsaroraxzaa77qxznlr5ei</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20151001054930/http://research.microsoft.com/pubs/215590/FPRF-ICALP.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/38/33/3833295cc232490f84fa850a30972305657ea739.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-39212-2_41"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 22,659 results