Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 7 of 7 for “"Bernoulli process"”.

  1. Running in circles : packet routing on ring networks

    … potato" protocol. If packets are inserted by a Bernoulli process and have uniform destinations around the ring, and if the nominal load is kept fixed, then I can construct an upper bound on the expected queue length per node that is independent of the size of the ring. If the packets only travel …

    mit Repository record for Running in circles : packet routing on ring networks (opens in a new tab)

  2. Multiple access networks over finite fields : optimality of separation, randomness and linearity

    … transmits in a bursty fashion according to a Bernoulli process. For the case when both transmitters always transmit, we propose a systematic code construction and show that it achieves the maximum code rate and capacity. We also propose a systematic random code construction and show that it …

    mit Repository record for Multiple access networks over finite fields : optimality of separation, randomness and linearity (opens in a new tab)

  3. Thinning of point processes-covariance analyses

    … addresses a class of problems in point process theory called 'thinning'. By thinning we mean an operation whereby a point process is split into two point processes by some rule. We obtain the covariance structure between the thinned processes under various thinning rules. We first obtain …

    vt Repository record for Thinning of point processes-covariance analyses (opens in a new tab)

  4. Inference of Low-Dimensional Latent Structure in High-Dimensional Data

    … upon compressive measurements. A truncated beta-Bernoulli process is employed to infer an appropriate dictionary for the test data, and also for image recovery. In the context of compressive sensing, significant improvements in image recovery are manifested using learned dictionaries, relative to …

    duke Repository record for Inference of Low-Dimensional Latent Structure in High-Dimensional Data (opens in a new tab)

  5. Chain rules for Rademacher complexity

    … estimates are obtained for expected suprema of Bernoulli processes indexed by an image of a bounded Euclidean subset through a class of Lipschitz functions. If that bounded subset is given by the projection of a bounded function class onto a sample vector, the result can be considered as a …

    uiuc Repository record for Chain rules for Rademacher complexity (opens in a new tab)

  6. Nonparametric Bayesian Modelling in Machine Learning

    … Bayesian non-parametric inference. The Dirichlet process and its extensions are priors on an infinite-dimensional space. Originally introduced by Ferguson (1983), its conjugacy property allows a tractable posterior inference which has lately given rise to a significant developments in applications …

    ottawa-retro Repository record for Nonparametric Bayesian Modelling in Machine Learning (opens in a new tab)

  7. Control and estimation with limited information: a game-theoretic approach

    … independent and identically distributed (i.i.d.) Bernoulli process. This problem is cast in the thesis within the framework of stochastic zero-sum dynamic games. First, a corresponding stochastic minimax state estimator (SMSE) is obtained, along with an associated generalized stochastic Riccati …

    uiuc Repository record for Control and estimation with limited information: a game-theoretic approach (opens in a new tab)