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 387 for “"Divide-and-Conquer"”.

  1. Synthesizing Divide-and-Conquer Programs

    … from large distributed systems to desktops and mobile phones. Their complex memory architecture enables fast and efficient execution when used correctly. Many efforts have been invested in making the task of taking advantage of these architectures easier. Among them, the development of …

    toronto-retro Repository record for Synthesizing Divide-and-Conquer Programs (opens in a new tab)

  2. Contributions to Divide-and-Conquer MCMC

    lancaster Download PDF for Contributions to Divide-and-Conquer MCMC (opens in a new tab)

  3. Divide-and-conquer algorithms for multiprocessors

    … there has been a tremendous surge in understanding the nature of parallel computation. A number of parallel computers are commercially available. However, there are some problems in developing application programs on these computers;This dissertation considers various issues involved in …

    iastate Repository record for Divide-and-conquer algorithms for multiprocessors (opens in a new tab)

  4. Divide and conquer sequential Monte Carlo for phylogenetics

    … availability of genetic sequencing data and relaxations of classical modelling assumptions. This thesis specializes a Divide & conquer sequential Monte Carlo (DCSMC) inference algorithm to phylogenetics to address these challenges. In phylogenetics, the tree structure used to represent …

    ubc Repository record for Divide and conquer sequential Monte Carlo for phylogenetics (opens in a new tab) Download PDF for Divide and conquer sequential Monte Carlo for phylogenetics (opens in a new tab)

  5. Divide and conquer : packet classification by smart division

    … classifiers form the backbone of many networking and security devices. Most packet classifiers are defined by a list of rules that each match a subset of all packets. As new threats and vulnerabilities emerge, these rule lists are getting larger and thus taking longer to search. However, networks …

    msu Repository record for Divide and conquer : packet classification by smart division (opens in a new tab)

  6. Tree-Based Hardware Recursion for Divide-and-Conquer Algorithms

    … processing unit (CPU). This is because FPGAs and ASICs can have handcrafted data and control paths which exploit parallelism in ways that CPUs cannot. However, designing custom hardware is complicated and implementing algorithms in a way that takes advantage of the desired parallelism can be …

    rit Repository record for Tree-Based Hardware Recursion for Divide-and-Conquer Algorithms (opens in a new tab)

  7. Divide and Conquer in Neural Style Transfer for Video

    … requires stylizing each of its component frames, and the stylized frames must have temporal consistency between them to prevent flickering and other undesirable features. Current algorithms accommodate these constraints at the expense of speed. We propose an algorithm called Distributed Artistic …

    rit Repository record for Divide and Conquer in Neural Style Transfer for Video (opens in a new tab)

  8. A divide-and-conquer method for 3D capacitance extraction

    This thesis describes a divide-and-conquer algorithm to improve the 3D boundary element method (BEM) for capacitance extraction. We divide large interconnect structures into small sections, set new boundary conditions using the borderfor each section, solve each section, and then combine the …

    tamu Repository record for A divide-and-conquer method for 3D capacitance extraction (opens in a new tab)

  9. Graph-based divide-and-conquer techniques for binary diffing

    … problem aimed at improving runtime efficiency and precision of the results generated. Our approach leverages program partitioning and applies binary diffing algorithms using a divide-and-conquer strategy, implemented in an extensible binary diffing pipeline. Specifically, we introduce three …

    greece Repository record for Graph-based divide-and-conquer techniques for binary diffing (opens in a new tab)

  10. An Occam Implementation of a Divide and Conquer Cyclic Reduction Algorithm

    … paper we present a method to solve a symmetric and tridiagonal system of linear equations on a parallel processing machine with vector nodes. This type of problem arises in such applications of numerical analysis as cubic spline interpolation and finite-difference methods for linear boundary …

    clemson Repository record for An Occam Implementation of a Divide and Conquer Cyclic Reduction Algorithm (opens in a new tab)

  11. DIVIDE AND CONQUER MODIFICATION OF THE BLUM-MICALI PSEUDORANDOM NUMBER GENERATOR

    The Blum-Micali pseudorandom number generator (PRNG) outputs cryptographically secure sequences of pseudorandom bits. One of the primary drawbacks of the Blum-Micali PRNG is that it can be computationally expensive and slow to run. This thesis proposes a modification to the Blum-Micali PRNG that …

    nps Repository record for DIVIDE AND CONQUER MODIFICATION OF THE BLUM-MICALI PSEUDORANDOM NUMBER GENERATOR (opens in a new tab)

  12. Divide and Conquer: Examining the Effects of Conflict Rhetoric on Political Support

    … more important in political strategy over time and is very often focused on delineating the differences between the parties. But, political messaging frequently involves targeting different social groups or non-political entities as responsible for social problems rather than political parties …

    utk-theses Repository record for Divide and Conquer: Examining the Effects of Conflict Rhetoric on Political Support (opens in a new tab)

  13. A Divide and Conquer with Semi-Global Failover for Software Defined Networks

    … Domain Name Service (DNS), caching, routing and many other services. Usually these functions come with the hardware at the user or customer’s premises. This can increase the revenue of the revenue, but also can cost a lot and also be extremely difficult to maintain. Moreover, it is important …

    unlv Repository record for A Divide and Conquer with Semi-Global Failover for Software Defined Networks (opens in a new tab) Download PDF for A Divide and Conquer with Semi-Global Failover for Software Defined Networks (opens in a new tab)

  14. Divide and Conquer, On Signal, Noise, and the Geometry of Neural Representations

    [ES] Esta tesis estudia y mejora el proceso de aprendizaje de redes neuronales artifi- ciales (ANNs) entrenadas para tareas de clasificación mediante el análisis de la separabilidad de las representaciones. Más allá de la precisión predictiva, exami- namos la organización interna de las …

    upv Repository record for Divide and Conquer, On Signal, Noise, and the Geometry of Neural Representations (opens in a new tab)

  15. Implementation of parallel and divide and conquer algorithms in DeFT (LCGTO-DF).

    … energy from the Coulomb repulsion integrals and the exchange correlation integrals causes the current bottleneck of DFT calculations. The parallelization of the three-centered two electron integrals should lead to improved efficiency. The use of the PVM communication package gives a way to a …

    ottawa-retro Repository record for Implementation of parallel and divide and conquer algorithms in DeFT (LCGTO-DF). (opens in a new tab)

  16. Divide-and-Conquer Distributed Learning: Privacy-Preserving Offloading of Neural Network Computations

    … at the edge becoming more commonplace, and inspired by the successes of the folding@home project utilizing crowdsourced computation, we consider the scenario of the crowdsourcing the computation required for training of a neural network particularly appealing. Distributed learning …

    arkansas Repository record for Divide-and-Conquer Distributed Learning: Privacy-Preserving Offloading of Neural Network Computations (opens in a new tab)

  17. Divide and conquer: an oscillatory division of labour in service of episodic memory

    Both oscillatory synchronisation and oscillatory desynchronisation underpin the formation and retrieval of episodic memories. This paradox begs the question: how can two polar opposite neural phenomena produce the same outcome? Here, we investigate this conundrum by presenting a series of empirical …

    birmingham Download PDF for Divide and conquer: an oscillatory division of labour in service of episodic memory (opens in a new tab)

Page 1 of 20