A variation of the Newton-Pepys problem and its connections to size-estimation problems
From MaRDI portal
Publication:385133
DOI10.1016/J.SPL.2013.02.008zbMATH Open1287.60015OpenAlexW2130732575MaRDI QIDQ385133FDOQ385133
Authors: Damiano Varagnolo, Luca Schenato, Gianluigi Pillonetto
Publication date: 29 November 2013
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.spl.2013.02.008
Recommendations
- scientific article; zbMATH DE number 1917750
- Variations on a theme by Neyman and Pearson
- Determining the Size of a Finite Population of Different Objects from a Finite Sample taken at Random with Replacement
- Classic problems of probability
- From the species problem to a general coverage problem via a new interpretation
Cites Work
- Distributed average consensus with least-mean-square deviation
- John Smith’s Problem
- A survey on distributed estimation and control applications using linear consensus algorithms
- Probabilistic counting algorithms for data base applications
- Title not available (Why is that?)
- Isaac Newton as a probabilist
- Peer counting and sampling in overlay networks, random walk methods
- The Distribution Of Totatives
- Message terminating algorithms for anonymous rings of unknown size
- Gossip consensus algorithms via quantized communication
Cited In (1)
This page was built for publication: A variation of the Newton-Pepys problem and its connections to size-estimation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385133)