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 100 for “"fully dynamic"”.

  1. Preserving large cuts in fully dynamic graphs

    … initiates the study of the MAX-CUT problem in fully dynamic graphs. Given a graph $G=(V,E)$, we present the first fully dynamic algorithms to maintain a $\frac{1}{2}$-approximate cut in sublinear update time under edge insertions and deletions to $G$. Our results include the following …

    uvic Repository record for Preserving large cuts in fully dynamic graphs (opens in a new tab)

  2. DGMT: A Fully Dynamic Hash-Based Group Signature

    … by an opening authority or group manager. In fully dynamic group signature schemes, new members can be added to the group after the initialization phase and existing members can be revoked from the group. The primary aim of this thesis is twofold. Firstly, it aims to conduct a comprehensive …

    calgary Repository record for DGMT: A Fully Dynamic Hash-Based Group Signature (opens in a new tab)

  3. Fully dynamic evaluation for conjunctive queries with free access patterns

    … over the input variables.</p> <p>We introduce a fully dynamic evaluation approach for such queries. It is fully dynamic in the sense that it supports both inserts and deletes of tuples to the input relations. Our approach computes a data structure that supports the enumeration of the output …

    oxford Repository record for Fully dynamic evaluation for conjunctive queries with free access patterns (opens in a new tab)

  4. Applications of a Novel Sampling Technique to Fully Dynamic Graph Algorithms

    … of a novel sampling technique to building fully-dynamic randomized graph algorithms. We present the following results: \begin{enumerate} \item A randomized algorithm to estimate the size of a cut in an undirected graph $G = (V, E)$ where $V$ is the set of nodes and $E$ is the set of edges …

    uvic Repository record for Applications of a Novel Sampling Technique to Fully Dynamic Graph Algorithms (opens in a new tab)

  5. Towards Fully Dynamic Surface Illumination in Real-Time Rendering using Acceleration Data Structures

    … ray tracing, and the push for fully dynamic realistic-looking video games, has been driving more research in the use of ray tracing in real-time applications. The work described in this thesis covers multiple aspects such as optimisations, adapting existing offline methods to …

    lund Repository record for Towards Fully Dynamic Surface Illumination in Real-Time Rendering using Acceleration Data Structures (opens in a new tab) Download PDF for Towards Fully Dynamic Surface Illumination in Real-Time Rendering using Acceleration Data Structures (opens in a new tab)

  6. Protocols for packet switched communication and reliable multicasting in fully-dynamic multi-hop wireless networks

    Designing protocols for a fully dynamic wireless packet switched networks pose unique challenges due to the constantly changing topology of the network. A set of protocols is presented that are capable of handling a fully dynamic wireless network in which switching centers and base stations are …

    njit Repository record for Protocols for packet switched communication and reliable multicasting in fully-dynamic multi-hop wireless networks (opens in a new tab)

  7. Design and implementation of a high speed and low power flash ADC with fully dynamic comparators

    … of a high speed low power flash ADC with fully dynamic comparators. For flash ADC design, fully dynamic comparator offers several very desirable attributes, like high speed and low power consumption. As a result, a significant improvement of overall performance is expected. The primary …

    nus Repository record for Design and implementation of a high speed and low power flash ADC with fully dynamic comparators (opens in a new tab) Download file for Design and implementation of a high speed and low power flash ADC with fully dynamic comparators (opens in a new tab)

  8. Real Time Visibility Culling with Hardware Occlusion Queries and Uniform Grids

    … are invisible on the fly. This allows for fully dynamic destructible and editable environments as opposed to static prebaked environments of the past. This paper presents an algorithm that uses Hardware Occlusion Queries to cull fully dynamic scenes in real-time. This algorithm is …

    calpoly Repository record for Real Time Visibility Culling with Hardware Occlusion Queries and Uniform Grids (opens in a new tab)

  9. How U.S. Agriculture Adjusts to Energy Price Changes

    … model, the partial adjustment model, and the fully dynamic model. The first three models are nested within the fully dynamic model using ]948-2002 U.S. agriculture data. Morishima elasticities of substitution and price elasticities are estimated to investigate whether U.S. agriculture's …

    ndsu Repository record for How U.S. Agriculture Adjusts to Energy Price Changes (opens in a new tab)

  10. Imaging and inverse problems of electromagnetic nondestructive evaluation

    … electromagnetic NDE system which can be either fully dynamic, quasistatic, or static depending on the operating frequency and material parameters. In a general electromagnetic NDE system, indirect inversion techniques which utilize large amounts of a priori knowledge and some type of calibration …

    iastate Repository record for Imaging and inverse problems of electromagnetic nondestructive evaluation (opens in a new tab)

  11. Flood Routing on Small Streams: A Review of Muskingum-Cunge, Cascading Reservoirs, and Full Dynamic Solutions

    … approximate methods were evaluated against two "fully dynamic" solutions: the UNET-based solver in HEC-RAS and the National Weather Service's FLDWAV program. The four models were tested on four natural streams in northeastern Kansas. Detailed procedures for creating "equivalent reaches" were …

    ku Repository record for Flood Routing on Small Streams: A Review of Muskingum-Cunge, Cascading Reservoirs, and Full Dynamic Solutions (opens in a new tab)

  12. Optimal Graph Streaming Algorithms and Further Advances in Modern Models of Computation

    … other modern models, including sublinear-time, fully dynamic, and oracle-based models. The first part of the thesis develops space-optimal algorithms for fundamental graph problems in the streaming setting. We study approximate minimum cut, k-vertex connectivity, maximum matching, minimum vertex …

    waterloo Repository record for Optimal Graph Streaming Algorithms and Further Advances in Modern Models of Computation (opens in a new tab)

  13. A Numerical Study of Nonspherical Black Hole Accretion

    … axisymmetric computer code for calculating fully relativistic ideal gas hydrodynamics around a Kerr black hole. The aim is to study fully dynamic inviscid fluid accretion onto black holes, as well as to study the evolution and development of nonlinear instabilities in pressure supported …

    uiuc Repository record for A Numerical Study of Nonspherical Black Hole Accretion (opens in a new tab)

  14. Dual algorithms for the densest subgraph problem

    … fails. (iii) Lastly, we design the first fully-dynamic algorithm which maintains a $(1-\epsilon)$ approximate densest subgraph in worst-case $\text{poly}(\log n, \epsilon^{-1})$ time per update. Our result improves upon the previous best approximation factor of $(1/4 - \epsilon)$ for fully …

    gatech Repository record for Dual algorithms for the densest subgraph problem (opens in a new tab)

  15. Surface based fluid animation using integral equations : simulation and compression

    … looks at exploiting the mathematics of vorticity dynamics and potential flow using integral equations to reformulate critical parts of fully dynamic fluid animation methods into surface based problems. These reformulations enable more efficient calculation and data-structures due to the reduction …

    ubc Repository record for Surface based fluid animation using integral equations : simulation and compression (opens in a new tab) Download PDF for Surface based fluid animation using integral equations : simulation and compression (opens in a new tab)

  16. Models describing ruminal in situ digestion as affected by the lag process and fractionation of substrate

    … lag is unlikely to occur in vivo; therefore, a fully dynamic, two-compartment model was used to describe digestion. Substrate present in the first compartment was considered unavailable for digestion. Flow of substrate from the first to the second compartment was described by a first-order …

    uiuc Repository record for Models describing ruminal in situ digestion as affected by the lag process and fractionation of substrate (opens in a new tab)

Page 1 of 5