نتایج جستجو برای: bounds testing
تعداد نتایج: 407196 فیلتر نتایج به سال:
A few years ago, Blais, Brody, and Matulef (2012) presented a methodology for proving lower bounds for property testing problems by reducing them from problems in communication complexity. Recently, Bhrushundi, Chakraborty, and Kulkarni (2014) showed that some reductions of this type can be deconstructed to two separate reductions, from communication complexity to parity decision trees and from...
The distributed hypothesis-testing problem with full side-information is studied. The trade-off (reliability function) between the type 1 and type 2 error exponents under limited rate is studied in the following way. First, the problem of determining the reliability function of distributed hypothesis-testing is reduced to the problem of determining the reliability function of channel-detection ...
The g-factor of the charged leptons has always been considered by many physicists, both experimentaly as well as theoretically. In fact the electron and muon g-factor play the main role in testing the QED as well as the standard model. Meanwhile, there is a discrepancy between the standard model prediction of the muon anomalies magnetic moment and its experimental determination as large as (25...
T he main objective of this paper was the investigation of the impact of the trade openness on economic growth in Pakistan. We have been employed both the Johensen and Autoregressive Distributed Lag (ARDL) Co-integration together with ECM Techniques for the period 1975-2016. The empirical estimated results are the sound evidence that there exists a short...
In the framework of prediction with expert advice, we consider a recently introduced kind of regret bounds: the bounds that depend on the effective instead of nominal number of experts. In contrast to the NormalHedge bound, which mainly depends on the effective number of experts but also weakly depends on the nominal one, we obtain a bound that does not contain the nominal number of experts at ...
We introduce the Singleton bounds for codes over a finite commutative quasi-Frobenius ring.
We prove Lieb-Robinson bounds for systems defined on infinite dimensional Hilbert spaces and described by unbounded Hamiltonians. In particular, we consider harmonic and certain anharmonic lattice systems.
We prove sharp Lieb-Thirring inequalities for Schrödinger operators with potentials supported on a hyperplane and we show how these estimates are related to LiebThirring inequalities for relativistic Schrödinger operators.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید