A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

Keywords

Mathematics, Combinatorics, Sample size determination, Measure (data warehouse), Statistics

References

• On Information and SufficiencyS. Kullback, R. A. Leibler — 1951

Cited by

• The differential equation method for random graph processes and greedy algorithmsNicholas Wormald — 1999
• ON INEQUALITIES FOR LARGE DEVIATIONS IN THE BERNOULLI SCHEMEV. M. Kruglov — 2004
• Analysis of Random Polling Dynamic Load BalancingPeter Sanders — 1997
• Optimization in the private value model: competitive analysis applied to auction designJason D. Hartline, Anna R. Karlin — 2003
• Expected time analysis of a simple recursive Poisson random variate generatorLuc Devroye — 1991
• Information Geometry, Bayesian Inference, Ideal Estimates and Error DecompositionHuaiyu Zhu, Richard Rohwer — 1998
• Learning to play network games: does rationality yield nash equilibrium?Bud Mishra, Amy Greenwald — 1998
• Information Geometry of α-Projection in Mean Field ApproximationШун-ичи Амари, Shiro Ikeda, Hidetoshi Shimokawa — 2004
• Extremal problems in pseudo-random graphs and asymptotic enumerationWojciech Samotij — 2010
• EMS3: An Improved Algorithm for Finding Edit-Distance Based Motifs正昭 石田 — 2020
• Tight bounds for data stream algorithms and communication problemsMert Sağlam — 2011
• Surjective cellular automata far from the Garden of EdenSilvio Capobianco, P. Guillon, Jarkko Kari — 2013
• CLASSIFICATION IN HIGH DIMENSIONAL FEATURE SPACESV. Van Dyk, Hendrik Oostewald — 2009
• Conception de réseaux de télécommunications : optimisation et expérimentations. (Telecommunication network design: optimization and experiments)Jean-François Lalande — 2004
• Constructive optimization for infinite-dimensional problems in probability and statisticsGeung-Ho Kim — 1978
• Techniques in manifold learning: Intrinsic dimension and principal surface estimationPurcell, Michael Patrick — 2010
• Mesh Connected Computers With Multiple Fixed Buses: Packet Routing, Sorting and SelectionSanguthevar Rajasekaran — 1992
• On the Rate of Clustering to the Strassen Set for Increments of the Uniform Empirical ProcessPhilippe Berthet — 1997
• Convergence Properties of Two-Stage Stochastic ProgrammingLiyi Dai, C. H. Chen, John R. Birge — 2000
• On the Learnability of the UncomputableRichard H. Lathrop — 1996

Related papers

• Review: William Shakespeare: Measure for Measure * Kate Chedgzoy: William Shakespeare: Measure for Measure2002
• Influence of Main Factors in Industry Measurement on Measure AccuracySun Jian — 2002
• The Relationship between components of sample size Estimate and Sample SizeMohanasundari S.K., Moirangthem Sonia — 2022
• "Measure for Measure."B. Nicholson — 1866
• The Axiomatization Definition of the Pseudo Measure of Fuzziness and the Pseudo Measure of Fuzziness of a Cosine FunctionFan Mingqu — 1999
• Measure for measure,' IIFranklin P. Adams — 1895
• Measure for measure' II. iv. 94: "All-building"Philip Perring — 1907
• The Error Analysis of Special Measure Tools DesignChen Long-hai — 2010
• Measure for Measure,' II. I. 39Br. Nicholson — 1891