Pages that link to "Item:Q5814290"

The following pages link to A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations (Q5814290):

Displaying 50 items.

• Effective bandwidths and performance bounds in high-speed communication systems (Q1289395) (← links)
• Random sampling and greedy sparsification for matroid optimization problems (Q1290633) (← links)
• Large deviation theorems for extended random variables and some applications (Q1291196) (← links)
• A new integral nonparametric test for the affine symmetry hypothesis (Q1291971) (← links)
• Elements of a theory of computer simulation. I (Q1294327) (← links)
• Chernoff-type bound for finite Markov chains (Q1296608) (← links)
• Signed domination in regular graphs and set-systems (Q1306310) (← links)
• Chernoff efficiency of the sign and Wilcoxon tests for testing the symmetry hypothesis (Q1313647) (← links)
• Singular stationary measures are not always fractal (Q1314316) (← links)
• An estimate of the probabilities of deviation of the sample mean (Q1324869) (← links)
• A self-normalized Erdős-Rényi type strong law of large numbers (Q1327544) (← links)
• Designing algorithms by expectations (Q1328761) (← links)
• Speed of convergence of the least-squares estimator in autoregressive models (Q1330172) (← links)
• Nonclairvoyant scheduling (Q1331961) (← links)
• Extended large deviations (Q1332408) (← links)
• On large deviation expansion of distribution of maximum likelihood estimator and its application in large sample estimation (Q1335352) (← links)
• A problem of Füredi and Seymour on covering intersecting families by pairs (Q1337172) (← links)
• Generalized divergence measures and the probability of error (Q1338635) (← links)
• Perturbation analysis of the \(GI/GI/1\) queue (Q1342953) (← links)
• Large deviations for fields with stationary independent increments (Q1343508) (← links)
• Expected complexity of graph partitioning problems (Q1346695) (← links)
• A design of a parallel dictionary using skip lists (Q1351441) (← links)
• Randomized routing on generalized hypercubes (Q1351447) (← links)
• Undecidable statements and random graphs (Q1353975) (← links)
• Self-normalized large deviations (Q1356343) (← links)
• Optimal convergence rates and asymptotic efficiency of point estimators under truncated distribution families (Q1359750) (← links)
• Functional Erdős-Rényi laws for processes indexed by sets (Q1365719) (← links)
• Efficient massively parallel implementation of some combinatorial algorithms (Q1365935) (← links)
• Random induced subgraphs of generalized \(n\)-cubes (Q1373443) (← links)
• On some conjectures of Graffiti (Q1377723) (← links)
• A lower bound for irredundant Ramsey numbers (Q1382826) (← links)
• Size-estimation framework with applications to transitive closure and reachability (Q1384531) (← links)
• Optimal bounds for the approximation of Boolean functions and some applications (Q1390872) (← links)
• Probabilistic robustness analysis: Explicit bounds for the minimum number of samples (Q1391598) (← links)
• Analysis and application of adaptive sampling (Q1394792) (← links)
• Faster deterministic sorting through better sampling. (Q1401197) (← links)
• When does a random Robin Hood win? (Q1401420) (← links)
• How to use several noisy channels with unknown error probabilities (Q1401948) (← links)
• Gustav Elfving's impact on experimental design. (Q1431163) (← links)
• Convexity and logical analysis of data (Q1575707) (← links)
• A large deviation theorem for \(U\)-processes (Q1579857) (← links)
• A near-optimal polynomial time algorithm for learning in certain classes of stochastic games (Q1583226) (← links)
• Large-deviation theorems in hypothesis-testing problems (Q1585954) (← links)
• Large-deviation probability and the local dimension of sets (Q1586588) (← links)
• Random subgraphs of Cayley graphs over \(p\)-groups (Q1590219) (← links)
• The passport control problem or how to keep a dynamic service system load balanced? (Q1603718) (← links)
• The complexity of theory revision (Q1606294) (← links)
• A probabilistic framework for problems with real structured uncertainty in systems and control (Q1614384) (← links)
• Minimax Euclidean separation rates for testing convex hypotheses in \(\mathbb{R}^{d}\) (Q1627564) (← links)
• The sharp threshold for making squares (Q1643387) (← links)