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 23 for “"Algorithmic properties"”.

  1. Programming models for speculative and optimistic parallelism based on algorithmic properties

    … or quality. In this thesis, I propose to utilize algorithmic properties to develop programming models that leverage this idea thereby providing models that increase and improve the parallelism that can be exploited. I exploit three distinct algorithmic properties: i) algorithmic diversity, ii) the …

    gatech Repository record for Programming models for speculative and optimistic parallelism based on algorithmic properties (opens in a new tab)

  2. Algorithmic properties of poly-Z groups and secret sharing using non-commutative groups

    Computational aspects of polycyclic groups have been used to study cryptography since 2004 when Eick and Kahrobaei proposed polycyclic groups as a platform for conjugacy based cryptographic protocols. In the first chapter we study the conjugacy problem in polycyclic groups and construct a family of …

    cuny-grad Repository record for Algorithmic properties of poly-Z groups and secret sharing using non-commutative groups (opens in a new tab)

  3. Topics on Climate Model Output Analyses

    … which establishes a theoretical framework and algorithmic properties of t-process based spatio-temporal modeling, for further use in modeling climate and neuroscience data.

    umn Repository record for Topics on Climate Model Output Analyses (opens in a new tab)

  4. Asteroidal Sets and Dominating Targets in Graphs

    … thesis is on various distance and domination properties in graphs. In particular, we prove strong results about the interactions between asteroidal sets and dominating targets. Our results add to or extend a plethora of results on these properties within the literature. We define the class of …

    nebraska Repository record for Asteroidal Sets and Dominating Targets in Graphs (opens in a new tab)

  5. A Scalable Flash-Based Hardware Architecture for the Hierarchical Temporal Memory Spatial Pooler

    … focused upon modeling the structural and algorithmic properties of the neocortex. It is comprised of two components, realizing pattern recognition of spatial and temporal data, respectively. HTM research has gained momentum in recent years, leading to both hardware and software exploration …

    rit Repository record for A Scalable Flash-Based Hardware Architecture for the Hierarchical Temporal Memory Spatial Pooler (opens in a new tab)

  6. Symbolic techniques for parameterised verification

    … and it is challenging because most relevant properties of parameterised systems are undecidable in general.</p> <p>In this thesis, we study automated verification approaches using automata-based symbolic model checking (a.k.a. regular model checking) as a generic formalism for parameterised …

    oxford Repository record for Symbolic techniques for parameterised verification (opens in a new tab)

  7. Secure Cloud Storage

    … comparative analysis of the security and algorithmic properties of 7 different erasure codes is presented, showing codes with better data security comes with a higher cost in computational time complexity. The codes which granted the highest configuration flexibility bested their peers, as …

    waterloo Repository record for Secure Cloud Storage (opens in a new tab)

  8. A methodology for structured modeling on the Masic decision support system generator

    … As such, this research is not concerned with algorithmic properties of MS models, but rather with the descriptive representation and manipulation of models that would eventually be solved by the algorithms. To achieve this purpose, the entity-relationship (E/R) approach will be presented as …

    nebraska Repository record for A methodology for structured modeling on the Masic decision support system generator (opens in a new tab)

  9. Decidability and Algorithmic Analysis of Dependent Object Types (DOT)

    … a detailed investigation of decidability and algorithmic properties of the family of DOT calculi. In decidability analysis, the undecidability of subtyping of several calculi is formally established, including the D <: and D ∧ calculi. Prior to this investigation, the undecidability of …

    waterloo Repository record for Decidability and Algorithmic Analysis of Dependent Object Types (DOT) (opens in a new tab)

  10. Extensions of Task-based Runtime for High Performance Dense Linear Algebra Applications

    … Even if we put aside the difficulty to express algorithmic parallelism and to efficiently execute applications at large scale, other open questions remain. The ever-growing scale of modern supercomputers induces a fast decline of the Mean Time To Failure. A generic, low-overhead, resilient …

    utk-theses Repository record for Extensions of Task-based Runtime for High Performance Dense Linear Algebra Applications (opens in a new tab)

  11. The Computational Complexity of Some Games and Puzzles With Theoretical Applications

    The subject of this thesis is the algorithmic properties of one- and two-player games people enjoy playing, such as Sudoku or Chess. Questions asked about puzzles and games in this context are of the following type: can we design efficient computer programs that play optimally given any opponent …

    cuny-grad Repository record for The Computational Complexity of Some Games and Puzzles With Theoretical Applications (opens in a new tab)

  12. Balancing generality and specialization for machine learning in the post-ISA era

    … a revolutionary approach where we delve into the algorithmic properties of applications to define domain-generic hardware acceleration solutions. We leverage the property that a wide range of machine learning algorithms can be modeled as stochastic optimization problems. Using this insight we …

    gatech Repository record for Balancing generality and specialization for machine learning in the post-ISA era (opens in a new tab)

  13. Computability and Complexity Properties of Automatic Structures and their Applications

    … over a one-letter alphabet. We investigate algorithmic properties of such graphs in terms of their finite presentations. In particular, we ask how hard it is to check whether a given node belongs to an infinite component, whether two given nodes in the graph are reachable from one another, …

    cornell Repository record for Computability and Complexity Properties of Automatic Structures and their Applications (opens in a new tab)

  14. Novel Methods For Source Localization And Material Identification

    … computation in order to demonstrate not only the algorithmic properties, but the computational scalability.

    cornell Repository record for Novel Methods For Source Localization And Material Identification (opens in a new tab)

  15. Programming frameworks for performance driven speculative parallelization

    … to leverage semantics of data structures and algorithmic properties to guide the scheduling of concurrent speculative transactions to minimize conflicts and performance loss. Fourth, we present DeSTM, a deterministic STM designed to aid the development of speculative transactional applications …

    gatech Repository record for Programming frameworks for performance driven speculative parallelization (opens in a new tab)

  16. Compiler and system for resilient distributed heterogeneous graph analytics

    … substrate called Phoenix that leverages the algorithmic properties of graph analytics applications to recover from faults with zero overheads during fault-free execution and show that Phoenix is 24x faster than previous state-of-the-art systems. In this dissertation, we also look at the new …

    texas Repository record for Compiler and system for resilient distributed heterogeneous graph analytics (opens in a new tab)

  17. X10 for high-performance scientific computing

    … X10 language is well suited to expressing the algorithmic properties of locality and irregular parallelism that are common to many methods for physical simulation. The work reported in this thesis was part of a co-design effort involving researchers at IBM and ANU in which two significant …

    anu Repository record for X10 for high-performance scientific computing (opens in a new tab)

  18. Accelerated deep learning for the edge-to-cloud continuum: A specialized full stack derived from algorithms

    … different devices and simultaneously exploits algorithmic properties to maximize the benefits from acceleration. To this end, this thesis first explores a tight integration of Neural Network (NN) accelerators within the massively-parallel GPUs with a minimal area overhead. We show that a …

    gatech Repository record for Accelerated deep learning for the edge-to-cloud continuum: A specialized full stack derived from algorithms (opens in a new tab)

  19. Verification of asynchronous concurrency and the shaped stack constraint

    … being equivalent to Petri nets, ACS enjoy good algorithmic properties. We develop a verification procedure that extracts a sound abstract model, in the form of an ACS, from a given Erlang program; the resulting ACS simulates the operational semantics of the input. Using this abstract model, we …

    oxford Repository record for Verification of asynchronous concurrency and the shaped stack constraint (opens in a new tab)

  20. Randomised algorithms for low temperature spin systems

    … are assigned. This behaviour is reflected by the algorithmic properties of these models. At high-temperatures, there exists a variety of algorithmic techniques for approximate counting and sampling – examples include the Markov chain Monte Carlo (MCMC) method and correlation decay. At low …

    oxford Repository record for Randomised algorithms for low temperature spin systems (opens in a new tab)

Page 1 of 2