40 On the Hardy Littlewood 3-tuple prime conjecture and convolutions of Ramanujan s 44:48 Quantitative estimates for the size of an intersection of sparse automatic sets 41:09 A new explicit bound for the Riemann zeta function 52:30 An explicit error term in the prime number theorem for ...
boundBernsteinpolynomialFor classic i.i.d. samples with an arbitrary nondegenerate and finite variance distribution, Papadatos (1995, Annals of the Institute of Statistical Mathematics, 47, 185–193) presented sharp lower and upper bounds on the variances of order statistics, expressed in population ...
Statistics - Machine LearningThis paper is devoted to regret lower bounds in the classical model of stochastic multi-armed bandit. A well-known result of Lai and Robbins, which has then been extended by Burnetas and Katehakis, has established the presence of a logarithmic bound for all ...
Daniel,Berend,and,... - 《Statistics & Probability Letters》 被引量: 16发表: 2012年 Optimal Algorithms for Finding Density-Constrained Longest and Heaviest Paths in a Tree (weight) whose path density is bounded by an upper bound and a lower bound The path density is the path weight divided...
The investigation on the lower bound is based on Yao's minimax principle. For the upper bounds, a simple randomized algorithm for linkage discovery is analyzed. Based on the Kruskal-Katona theorem, we present an upper bound for discovering the linkage graph. As a corollary, we rigorously prove...
The main results of the paper are an upper and a lower bound for the Frobenius norm of the matrix sinΘ, of the sines of the canonical angles between unperturbed and perturbed eigenspaces of a regular generalized Hermitian eigenvalue problem Ax=λBx where A and B are Hermitian n×n matrice...
The attached MINLP makes Alpine behave erratically, as it computes a lower (dual) bound that exceeds the upper (primal) bound since the first iteration. The underlying solvers are: mip solver CPLEX 20.1, nlp local solver Juniper (Ipopt + CPLEX), using default settings except for the number ...
2) lower (upper) confidence limit 置信下限(置信上限)3) confidence lower limit 置信下限 1. According to the study of unrepairable product residue mean life,based on the mathematical description of the residue mean life and the basic knowledge of reliability and mathematical statistics,a method ...
Upper and lower bounds for expected utility The decision-theoretic literature has developed very few techniques to bound the expected utility of a random variable when only simple statistics like its... M Licalzi - 《Economic Theory》 被引量: 56发表: 2000年 Upper and Lower Bounds on Time-Spac...
We provide an explicit, iterative algorithm that improves the upper bound at each iteration. We also provide an effective method for iteratively optimizing the lower bound. To demonstrate the effectiveness of our algorithms, we provide several examples of partial response and fading channels where the...