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 103 for “"Distinct elements"”.

  1. Distinct random sampling from a distributed stream

    … continuous maintenance of a random sample of distinct elements from a massive data stream, whose input elements are observed at multiple distributed sites that communicate via a central coordinator. At any point, when a query is received at the coordinator, it responds with a random sample …

    iastate Repository record for Distinct random sampling from a distributed stream (opens in a new tab)

  2. An Application of Combinatorial Methods

    … type of probability problem: C ordered possible elements that are equally likely s independent sampled subjects r distinct elements, where r = 1, 2, 3, , min (C, s) we want to know P(s subjects utilize exactly r distinct elements). This thesis gives a detailed step by step analysis on techniques …

    vcu Repository record for An Application of Combinatorial Methods (opens in a new tab)

  3. String Quartet

    … and coming to a complete diffusion of all the distinct elements and gestures of those parts into just one wave of motion.

    washington Repository record for String Quartet (opens in a new tab)

  4. Streaming algorithms with differential privacy guarantee

    Given a data stream (a sequence of items), the distinct element estimation problem aims to approximate the number of unique items in the stream. We present two streaming algorithms to solve the distinct element estimation problem, and we prove that both are differentially private. The first …

    ubc Repository record for Streaming algorithms with differential privacy guarantee (opens in a new tab) Download PDF for Streaming algorithms with differential privacy guarantee (opens in a new tab)

  5. On diamond-free subposets of the Boolean lattice: An application of flag algebras

    … two, also known as the diamond, consists of four distinct elements with the following property: A B;C D. The 3-crown consists of six distinct elements with the following property: A a subset of B, D and B a subset of C E and A a subset of C, F. A P-free family in the n-dimensional Boolean lattice …

    iastate Repository record for On diamond-free subposets of the Boolean lattice: An application of flag algebras (opens in a new tab)

  6. Upper and lower bounds on permutation codes of distance four

    … by PA(n, d), is a subset of Sn such that any two distinct elements have a distance of at least d where d is the number of differing positions. We analyze the upper and lower bounds of permutation codes with distance equal to 4. An optimization problem on Young diagrams is used to improve the upper …

    uvic Repository record for Upper and lower bounds on permutation codes of distance four (opens in a new tab)

  7. ‘Need’ and ‘Necessity’ in Law: A Conceptual Inquiry through Intension and Extension

    … compromised due to a failure to appreciate two distinct elements of such concepts: that of their intension and extension. This paper seeks to prove, primarily through the scope of 'need' and 'necessity', that neglecting this distinction has had alarming ramifications for both legal theory and …

    kent Download PDF for ‘Need’ and ‘Necessity’ in Law: A Conceptual Inquiry through Intension and Extension (opens in a new tab)

  8. Linear associative algebra and quaternions

    Let us assume that there exists a system E of distinct elements a1, a2, a3, .......... and that there also exist processes of combinations in a specified order of any two of these elements or of any one with itself, each of which yields a determinate result which is also an element of the system E. …

    sask Repository record for Linear associative algebra and quaternions (opens in a new tab)

  9. Double-Change Covering Designs with Block Size k = 4

    … · · · ,Bb}, each an unordered subset of k distinct elements from [v] = {1, 2, · · · , v}, which obey: (1) each block differs from the previous block by two elements, and, (2) every unordered pair of [v] appears in at least one block. The object is to minimize b for a fixed v and k. Tight …

    siu-theses Repository record for Double-Change Covering Designs with Block Size k = 4 (opens in a new tab)

  10. On the principle of MINQUE for the estimation of variance and covariance components

    … (1977) outlines the extension for estimating the elements of a covariance matrix using this principle. The method extends easily for the case when no a priori guess of the covariance matrix is assumed. However, for incorporating the a priori guess for estimating the distinct elements of a …

    concordia Download PDF for On the principle of MINQUE for the estimation of variance and covariance components (opens in a new tab)

  11. New algorithms for private estimation of fundamental statistics

    … connected components in a network, (2) counting distinct items in turnstile streams, and (3) testing conditional independence. These tasks are fundamental building blocks for more complex data analyses, but previously, have been studied either in restricted settings, or not all, through the lens …

    bu Repository record for New algorithms for private estimation of fundamental statistics (opens in a new tab)

  12. Approximating Properties of Data Streams

    … properties in the data stream model, where elements of an underlying data set arrive sequentially, but algorithms must use space sublinear in the size of the underlying data set. We first study the problem of finding all k-periods of a length-n string S, presented as a data stream. S is said …

    purdue-thes Repository record for Approximating Properties of Data Streams (opens in a new tab)

  13. Improving Cuckoo Hashing with Perfect Hashing

    … is more efficient. Perfect Hashing maps distinct elements to set of integers without any collision. Perfect Hashing is fast and hit ratio is high. There are many other hashing techniques like Perfect Hashing but the reason we choose perfect hashing as it doesn’t require collision …

    umkc Repository record for Improving Cuckoo Hashing with Perfect Hashing (opens in a new tab)

  14. Partial Quicksort and weighted branching processes

    … Quicksort algorithm, sort an unsorted array of n distinct elements. Partial Quicksort sorts the l smallest elements in a list of length n. Both stochastic divide-and-conquer algorithms are widely studied. Our algorithm Quicksort on the y provides online the rst smallest, then second smallest and …

    cau-kiel Repository record for Partial Quicksort and weighted branching processes (opens in a new tab)

  15. A scalable software framework for solving PDEs on distributed octree meshes using finite element methods

    … tracking in fluids. We bring together three distinct elements to accomplish this: (a) a parallel octree based adaptive mesh generation framework, (b) a variational multiscale (VMS) based treatment that enables flow condition agnostic simulations (laminar or turbulent)~\cite{Bazilevs07b}, and …

    iastate Repository record for A scalable software framework for solving PDEs on distributed octree meshes using finite element methods (opens in a new tab)

  16. Per-flow cardinality estimation based on virtual LogLog sketching

    … is the problem of estimating the number of distinct elements in a data flow, often with a stringent memory constraint. It has wide applications in network traffic measurement and in database systems. The virtual LogLog algorithm proposed recently by Xiao, Chen, Chen and Ling estimates the …

    uiuc Repository record for Per-flow cardinality estimation based on virtual LogLog sketching (opens in a new tab)

  17. The Communal "I": Exclusion and Belonging in American Autobiography

    … case “the master’s tools” to refer to several distinct elements the communal “I” is tasked with navigating: the use of what we have come to identify as standard English, the form and function of European autobiography as a celebration of individual exceptionalism, and the contradictory …

    cuny-grad Repository record for The Communal "I": Exclusion and Belonging in American Autobiography (opens in a new tab)

  18. A unified design of capsules

    … of the Panini language splits the world into two distinct elements – capsules and systems. A capsule acts as the unit of both modularity and concurrency in the program. A system acts as the sole point of composition for capsule instances. The problem is that the dichotomy between systems and …

    iastate Repository record for A unified design of capsules (opens in a new tab)

Page 1 of 6