Search
Now showing items 31-40 of 1257
Computational And Combinatorial Problems On Some Geometric Proximity Graphs
(2017-05-24)
In this thesis, we focus on the study of computational and combinatorial problems on various geometric proximity graphs. Delaunay and Gabriel graphs are widely studied geometric proximity structures. These graphs have been ...
Efficient Usage Of Flash Memories In High Performance Scenarios
(2016-09-09)
New PCI-e flash cards and SSDs supporting over 100,000 IOPs are now available, with several usecases in the design of a high performance storage system. By using an array of flash chips, arranged in multiple banks, large ...
Sentiment-Driven Topic Analysis Of Song Lyrics
(2015-08-17)
Sentiment Analysis is an area of Computer Science that deals with the impact a document makes on a user. The very field is further sub-divided into Opinion Mining and Emotion Analysis, the latter of which is the basis for ...
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 ...
An Algorithmic Characterization Of Polynomial Functions Over Zpn
(2014-07-04)
The problem of polynomial representability of functions is central to many branches of mathematics. If the underlying set is a finite field, every function can be represented as a polynomial. In this thesis we consider ...
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 ...