We derive quantitative bounds on the rate of convergence in L^1 L^1 Wasserstein distance of general M-estimators, with an almost sharp (up to a logarithmic term) behavior in the number of observations. We focus on situations where the estimator does not have an explicit expression as a func...
Bounds on the efficiencies of estimators constructed by minimization of the Cramér-Mises distanceHumansHand InjuriesAngiographyPhlebographyReplantationAdultMaleNot Availabledoi:10.1007/BF00559413Shulenin, V. PKluwer Academic Publishers-Plenum PublishersRussian Physics Journal...
importjava.awt.Component;//导入方法依赖的package包/类privatevoidscrollEnd(JScrollPane scrollpane){ JViewport vp = scrollpane.getViewport(); Component view;if(vp !=null&& (view = vp.getView()) !=null) { Rectangle visRect = vp.getViewRect(); Rectangle bounds = view.getBounds();if(scrollpa...
However, for many applications, including the bounds on ACC circuits, it would be su cient to prove lower bounds on some restricted class of protocols. Of particular interest are one-way (multiparty) protocols, where the players speak in a prescribed order, each of them only once: rst ...
V. P. Ipatov, "On the Karystinos-Pados bounds and optimal binary DS-CDMA signature ensembles," IEEE Comm. Letters, vol. 8, pp. 81-83, Feb. 2004.Ipatov VP. On the Karystinos-Pados bounds and opti- mal binary DS-CDMA signature ensembles. IEEE Communications Letters 2004; 8: 81-83....
covering radius of a latticeThere is an error in our paper "Bounds on the covering radius of a lattice" published in this journal in 1996 (vol. 43, pp. 159–164). Theorem 1 of the paper should be corrected as follows. (Received November 18 1997)...
New upper bounds on harmonious colorings We present an improved upper bound on the harmonious chromatic number of an arbitrary graph. We also consider fragmentable classes of graphs (an example is the class of planar graphs) that are, roughly speaking, graphs that can be decomp... K Edwards...
We adopt a notion of attack stealthiness based on the Kullback-Leibler divergence measure, and characterize the worst case degradation induced by an attacker with a fixed stealthiness level. Additionally, we characterize optimal attack strategies that achieve our bound of performance degradation, ...
Morphology-dependent Hashin–Shtrikman bounds on the effective properties of stress-gradient materialsdoi:10.1016/J.EUROMECHSOL.2020.104072S. BrisardV.P. TranK. SabElsevier Masson
Siu, “Lower bounds on threshold and related circuits via communication complexity IEEE Transactions on Information Theory, 40(2) , pp. 467–474, 1994.V. Roychowdhury, A. Orlitsky, and K. Y. Siu, \Lower Bounds on Threshold and Related Circuits via Com- munication Complexity," IEEE ...