Results 281 to 290 of about 4,004,008 (323)

Optimal uniform continuity bound for conditional entropy of classical–quantum states

Quantum Information Processing, 2019
In this short note, I show how a recent result of Alhejji and Smith (A tight uniform continuity bound for equivocation, 2019. arXiv:1909.00787v1) regarding an optimal uniform continuity bound for classical conditional entropy leads to an optimal uniform ...
M. Wilde
semanticscholar   +1 more source

Perturbing Uniform Ultimate Bounded Differential Systems

SIAM Journal on Mathematical Analysis, 1972
We obtain results on the eventual uniform boundedness and eventual uniform ultimate boundedness of solutions of the differential equation \[ \dot x = f(t,x) + g(t,x)\] given that solutions of the equation $\dot x = f(t,x)$ are uniformly bounded and uniformly ultimately bounded. By assuming various regularity conditions on f we obtain admissible classes
openaire   +1 more source

Bounds for Multifit Scheduling on Uniform Processors

SIAM Journal on Computing, 1983
The authors examine the nonpreemptive assignment of n independent tasks to a system of m uniform processors with the objective of reducing the makespan, or the time required from the start of execution until all tasks are completed. Since the problem of finding a minimal makespan has been shown to be np-hard, and hence unlikely to permit an efficient ...
Friesen, D. K., Langston, M. A.
openaire   +1 more source

Uniform and Non-uniform Bounds Under Local Dependence

2011
Chapter 9 considers local dependence using the K-function approach, and obtains both uniform and non-uniform Berry–Esseen bounds. The results are applied to certain scan statistics, and yield a general theorem when the local dependence can be expressed in terms of a dependency graph whose vertices are the underlying variables, and where two non ...
Louis H. Y. Chen, Larry Goldstein, Qi-Man Shao   +2 more
openaire   +1 more source

Bounds for LPT Schedules on Uniform Processors

SIAM Journal on Computing, 1977
We study the performance of LPT (largest processing time) schedules with respect to optimal schedules in a nonpreemptive multiprocessor environment. The processors are assumed to have different speeds and the tasks being scheduled are independent.
Gonzalez, Teofilo, Ibarra, Oscar H., Sahni, Sartaj   +2 more
openaire   +1 more source

Lower Bounds Against Weakly-Uniform Threshold Circuits

Algorithmica, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Ruiwen, Kabanets, Valentine, Kinne, Jeff   +2 more
openaire   +2 more sources

Partition-based uniform error bounds

1998 IEEE International Joint Conference on Neural Networks Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36227), 2002
Develops probabilistic bounds on out-of-sample error rates for several classifiers using a single set of in-sample data. The bounds are based on probabilities over partitions of the union of in-sample and out-of-sample data into in-sample and out-of-sample data sets.
openaire   +1 more source

Non-uniform bound and finite time blow up for solutions to a drift–diffusion equation in higher dimensions

, 2016
T. Ogawa, H. Wakui
semanticscholar   +1 more source

A Non-Uniform Bound of the Remainder Term in the Central Limit Theorem for Bernoulli Random Variables

, 2016
S. Nagaev, V. Chebotarev, A. Zolotukhin
semanticscholar   +1 more source

A uniform bound for geodesic periods of eigenfunctions on hyperbolic surfaces

, 2015
A. Reznikov
semanticscholar   +1 more source