Results 281 to 290 of about 311,946 (315)
Some of the next articles are maybe not open access.
Bounding Gallager’s Expurgated Bound
IEEE Communications Letters, 2017A modification of the Lovasz theta function, called $\vartheta (\rho )$ , was introduced for the purpose of studying error exponents for codes over discrete memoryless channels by Dalai. It was mentioned that this function allows one to upper bound the multi-letter version of Gallager’s expurgated lower bound on the reliability function, but ...
openaire +1 more source
Bounded minimalisation and bounded counting in argument-bounded idc's
Mathematical Structures in Computer Science, 2010We define and investigate a number of small inductively defined classes (idc's),à laGregorczyk, that are based onargument-boundedinitial functions and thebounded minimalisationandbounded countingschemata. We establish equivalences between these and other classes in the literature, with an emphasis on minimalism.
openaire +1 more source
Cone-bounded nonlinearities and mean-square bounds--Estimation upper bound
IEEE Transactions on Automatic Control, 1973This paper is the first in a series of three, the remaining two of which will appear at a later date. Performance bounds are derived in this series of papers for causal state estimation and regulation problems employing mean-square criteria. The systems considered are partially observed finite-dimensional continuous-time stochastic processes driven by ...
Gilman, Alfred S., Rhodes, Ian B.
openaire +3 more sources
Free-to-Bound and Bound-to-Bound Transitions in CdS
Physical Review, 1966Time-resolved photoluminescence spectra of two green broad emission bands in CdS have been observed as a function of temperature. New structure was discovered in both bands, and has been attributed to transverse optical phonons. From the wavelength shift of the emitted light with time and temperature, it is concluded that the shorter wavelength band ...
openaire +1 more source
Fundamenta Informaticae, 2006
In this paper we derive the bounds for Validation (known also as Hold-Out Estimate and Train-and-Test Method). We present the best possible bound in the case of 0–1 valued loss function. We also provide the tables where the least sample size is calculated that is necessary for obtaining the bound for a given estimation rate and reliability of ...
openaire +3 more sources
In this paper we derive the bounds for Validation (known also as Hold-Out Estimate and Train-and-Test Method). We present the best possible bound in the case of 0–1 valued loss function. We also provide the tables where the least sample size is calculated that is necessary for obtaining the bound for a given estimation rate and reliability of ...
openaire +3 more sources
Bounds and error bounds for queueing networks
Annals of Operations Research, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
Microchoice Bounds and Self Bounding Learning Algorithms
Machine Learning, 1999A major topic in machine learning is to determine good upper bounds on the true error rates of learned hypotheses based upon their empirical performance on training data. In this paper, we demonstrate new adaptive bounds designed for learning algorithms that operate by making a sequence of choices.
John Langford 0001, Avrim Blum
openaire +1 more source
Cone-bounded nonlinearities and mean-square bounds--Quadratic regulation bounds
IEEE Transactions on Automatic Control, 1976Deterministic and stochastic control problems are examined for a broad class of nonlinear dynamic systems with quadratic cost criteria. The systems considered are partially observed continuous-time stochastic process, and are incrementally conic in the sense that, when modeled by Ito differential equations, they contain drift coefficients that are ...
Gilman, Alfred S., Rhodes, Ian B.
openaire +2 more sources
Time bounds for broadcasting in bounded degree graphs
1990Broadcasting is the process of transmitting a message from a node to all other nodes in a network. The problem of constructing sparse graphs in which the broadcast could be accomplished in minimum time has been investigated in several papers. However, the proposed graphs may have nodes of high degree that could be unacceptable from a network designer's
R. M. Capocelli +2 more
openaire +2 more sources