Search
Now showing items 31-40 of 245
Tiling Stencil Computations To Maximize Parallelism
(2017-05-21)
Stencil computations are iterative kernels often used to simulate the change in a discretized spatial domain overtime (e.g., computational fluid dynamics) or to solve for unknowns in a discretized space by converging to a ...
MIST : Mlgrate The Storage Too
(2017-05-25)
We address the problem of migration of local storage of desktop users to remote sites. Assuming a network connection is maintained between the source and destination after the migration makes it possible for us to transfer ...
Two Player Game Variant Of The Erdos Szekeres Problem
(2014-08-01)
The following problem has been known for its beauty and elementary character. The Erd˝os Szekeres problem[7]:
For any integer k ≥ 3, determine if there exists a smallest positive integer N(k) such that any set of atleast ...
A Refinement-Based Methodology for Verifying Abstract Data Type Implementations
(2018-06-21)
This thesis is about techniques for proving the functional correctness of Abstract Data Type (ADT) implementations. We provide a framework for proving the functional correctness of imperative language implementations of ...
Supervised Classification of Missense Mutations as Pathogenic or Tolerated using Ensemble Learning Methods
(2018-07-09)
Missense mutations account for more than 50% of the mutations known to be involved in human inherited diseases. Missense classification is a challenging task that involves sequencing of the genome, identifying the variations, ...
Ranking from Pairwise Comparisons : The Role of the Pairwise Preference Matrix
(2018-07-05)
Ranking a set of candidates or items from pair-wise comparisons is a fundamental problem that arises in many settings such as elections, recommendation systems, sports team rankings, document rankings and so on. Indeed it ...
Stochastic Approximation Algorithms with Set-valued Dynamics : Theory and Applications
(2018-07-05)
Stochastic approximation algorithms encompass a class of iterative schemes that converge to a sought value through a series of successive approximations. Such algorithms converge even when the observations are erroneous. ...
Efficient Static Analyses for Concurrent Programs
(2018-06-29)
Concurrent programs are pervasive owing to the increasing adoption of multi-core systems across the entire computing spectrum. However, the large set of possible program behaviors make it difficult to write correct and ...
Compilation of Graph Algorithms for Hybrid, Cross-Platform and Distributed Architectures
(2018-07-09)
1. Main Contributions made by the supplicant:
This thesis proposes an Open Computing Language (OpenCL) framework to address the challenges of implementation of graph algorithms on parallel architectures and large scale ...
Automatic Optimization of Geometric Multigrid Methods using a DSL Approach
(2018-06-14)
Geometric Multigrid (GMG) methods are widely used in numerical analysis to accelerate the convergence of partial differential equations solvers using a hierarchy of grid discretizations. These solvers find plenty of ...