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 20 of 37 for “"Threshold Function"”.

  1. Extremal problems in graphs

    … yields the asymptotically exact minimum degree threshold that ensures a graph \(G\) contains an \(H\)-tiling covering an \(x\)-proportion of the vertices of \(G\) (for any fixed \(x ∈\) (0, 1) and graph \(H\)). In Chapter 2, we give a degree sequence strengthening of this result. A fundamental …

    birmingham Download PDF for Extremal problems in graphs (opens in a new tab)

  2. Essays on Stochastic Inventory Systems

    … of such systems, we show that the expected cost function is concave in the input price. From this, it follows that higher input price variability in the sense of the convex order always leads to lower expected cost. We show that this is true under a wide range of assumptions for price evolution, …

    umn Repository record for Essays on Stochastic Inventory Systems (opens in a new tab)

  3. ΖΗΤΗΜΑΤΑ ΣΥΝΕΚΤΙΚΟΤΗΤΑΣ ΣΕ ΤΥΧΑΙΟΥΣ ΓΡΑΦΟΥΣ

    … ISSUES IN RANDOM GRAPHS. WE ESTIMATE THE THRESHOLD FUNCTION FOR THE EXISTENCE OF MANY, SHORT, VERTEX DISJOINT PATHS IN RANDOM GRAPHS.FURTHERMORE, WE PROVE THE EXISTENCE OF A GIANT CONNECTED COMPONENT IN RANDOM GRAPHS WITH EDGE FAULTS. WE ALSO SHOW THAT THIS GIANT COMPONENT IS A CERTIFIABLE …

    greece Repository record for ΖΗΤΗΜΑΤΑ ΣΥΝΕΚΤΙΚΟΤΗΤΑΣ ΣΕ ΤΥΧΑΙΟΥΣ ΓΡΑΦΟΥΣ (opens in a new tab)

  4. Novel Data Summaries for Join Query Optimization

    … state management algorithm applicable to the threshold-function-over-joins-scenario; a common setting in streaming data management. We demonstrate significant state savings and prove that our method is optimal while still guaranteeing no false positives; no threshold function triggers will be …

    washington Repository record for Novel Data Summaries for Join Query Optimization (opens in a new tab)

  5. A jump-search procedure for sequential decoding systems

    … the tentatively decoding path has violated the threshold function. If the errors occur at 2nd, 3rd branches, we connect the 1st and 4th branches. By jumping over the errors, a correct path can be obtained. This article describes the use of the jumping method, according to the group property of …

    rice Repository record for A jump-search procedure for sequential decoding systems (opens in a new tab)

  6. Randomness as a tool for modeling and uncovering structure

    … in the brain, we describe a method of building a threshold function by randomly connecting small primitive Boolean circuits. Our construction demonstrates the theme that a series of random choices can produce a structured object, in this case a Boolean circuit that computes a threshold function. …

    gatech Repository record for Randomness as a tool for modeling and uncovering structure (opens in a new tab)

  7. Unidirectional CORDIC for Efficient Computation of Trigonometric and Hyperbolic Functions

    … of trigonometric, logarithmic and transcendental functions by performing vector rotations, which can be implemented with only shift and add operations in a digital system. CORDIC algorithms are extensively used in the areas of digital signal processing, digital image processing and artificial …

    odu Repository record for Unidirectional CORDIC for Efficient Computation of Trigonometric and Hyperbolic Functions (opens in a new tab)

  8. A Proposed Algorithm Toward Uniform-distribution Monotone DNF Learning

    … up the problem of whether polynomial-size DNF functions are PAC learnable in polynomial time. It has been about twenty years that the DNF learning problem has been widely regarded as one of the most important ---and challenging --- open questions in Computational Learning Theory. We consider a …

    duquesne Repository record for A Proposed Algorithm Toward Uniform-distribution Monotone DNF Learning (opens in a new tab)

  9. Tools for binary decision diagram analysis

    … in the design and verification of switching functions. This is due to to its compactness, where size is measured by the number of nodes. In the implementation of logic circuits, connection of sub-functions is by means of pass transistors. The delay time for the interconnections is often …

    nps Repository record for Tools for binary decision diagram analysis (opens in a new tab)

  10. An introduction to the theory of random graphs

    … we conclude by introducing the notion of a threshold function for a monotone graph property and we present proofs for the threhold functions of certain properties.

    birmingham Download PDF for An introduction to the theory of random graphs (opens in a new tab)

  11. Low-depth circuit size bounds using combinatorial methods

    … circuit size lower bounds for the clique, threshold and parity functions. The thesis is centred around the combinatorial tools and questions relevant for attacking these circuit size lower bound problems.<br><br>First, the analysis will focus on the maximum one-sided correlation achievable …

    oxford Repository record for Low-depth circuit size bounds using combinatorial methods (opens in a new tab)

  12. Contributions to Extreme Value Theory in the Space C[0,1]

    … extreme value theory in the space of continuous functions on compact intervals and provide basic definitions and tools. Continuous max-stable processes on [0,1] are characterized by their “distribution functions” G which can be represented via a norm on function space, called D-norm. The high …

    wurz-thes Repository record for Contributions to Extreme Value Theory in the Space C[0,1] (opens in a new tab)

  13. A survey on the orthogonal expansion of threshold functions.

    … and study of the structure of switching functions and their realizations/have received considerable attention in the past ten years. They were studied under various names such as the coordinate representation (13), the discrete Fourier transform (3), the Rademacher - Walsh expansion (7, …

    ottawa-retro Repository record for A survey on the orthogonal expansion of threshold functions. (opens in a new tab)

  14. Halfway to Halfspace Testing

    … only random samples. A halfspace, or linear threshold function, is a boolean function f : Rⁿ → {±1} defined as the sign of a linear function; that is, f(x) = sign(Σᵢ wᵢxᵢ - θ) where we refer to w ∈ Rⁿ as a weight vector and θ ∈ R as a threshold. These functions have been studied intensively …

    waterloo Repository record for Halfway to Halfspace Testing (opens in a new tab)

  15. Random Vectors Over Finite Fields

    … result in the study of random objects is a threshold function that describes the behavior of a given property of the objects. We will discuss previous threshold functions and methods used to find them. The results found for this problem before now have been for vectors of bounded or fixed …

    clemson Repository record for Random Vectors Over Finite Fields (opens in a new tab)

  16. Development and application of multi-layer neural networks for estimation of power plant variables

    … networks to characterize process variables as a function of other related variables is studied. These neural networks are implemented as signal estimation models. This is a departure from the traditional discrete classification problem. The <i>Backpropagation Network (BPN)</i> is used to generate …

    ut-knoxville Repository record for Development and application of multi-layer neural networks for estimation of power plant variables (opens in a new tab)

  17. Randomised Kaczmarz Method

    … sparse Kaczmarz method by applying soft-threshold function and based on this, we further build an exact-step randomised sparse Kaczmarz method based upon introducing concepts on Bregman distance and projection. Also, we carefully prove the convergence of these methods by adopting concepts …

    anu Repository record for Randomised Kaczmarz Method (opens in a new tab)

  18. Technology Diffusion on Spiders

    … : given an undirected graph, G = (V,E), and a threshold function θ : V → {2, ..., |V|} on all nodes v ∈ V, a node v is considered activated whenever it becomes adjacent to a connected component containing at least θ(v) active nodes. The objective, referred to as seed minimization, is to find a …

    waterloo Repository record for Technology Diffusion on Spiders (opens in a new tab)

  19. Robust Chroma Keying System Based on Human Visual Perception and Statistical Color Models

    … ecting background light. With this assumption, a threshold function (TF) on a saturation-lightness plane is de ned according to human visual experiments. The pixels with color mixed with the background light (conventional unknown pixels) are now further categorized into re ective pixels and …

    ottawa-retro Repository record for Robust Chroma Keying System Based on Human Visual Perception and Statistical Color Models (opens in a new tab)

Page 1 of 2