Search
Now showing items 51-60 of 72
Generalization of Hitting, Covering and Packing Problems on Intervals
(2018-05-29)
Interval graphs are well studied structures. Intervals can represent resources like jobs to be sched-uled. Finding maximum independent set in interval graphs would correspond to scheduling maximum number of non-conflicting ...
Automatic Storage Optimization of Arrays Affine Loop Nests
(2018-03-01)
Efficient memory usage is crucial for data-intensive applications as a smaller memory footprint ensures better cache performance and allows one to run a larger problem size given a axed amount of main memory. The solutions ...
Designing Energy-Aware Optimization Techniques through Program Behaviour Analysis
(2018-02-18)
Green computing techniques aim to reduce the power foot print of modern embedded devices with particular emphasis on processors, the power hot-spots of these devices. In this thesis we propose compiler-driven and profile-driven ...
Reeb Graphs : Computation, Visualization and Applications
(2018-02-23)
Level sets are extensively used for the visualization of scalar fields. The Reeb graph of a scalar function tracks the evolution of the topology of its level sets. It is obtained by mapping each connected component of a ...
Effective Automatic Computation Placement and Data Allocation for Parallelization of Regular Programs
(2018-02-15)
Scientific applications that operate on large data sets require huge amount of computation power and memory. These applications are typically run on High Performance Computing (HPC) systems that consist of multiple compute ...
Matching Domain Model with Source Code using Relationships
(2018-01-30)
We address the task of mapping a given domain model (e.g., an industry-standard reference model) for a given domain (e.g., ERP), with the source code of an independently developed application in the same domain. This has ...
Variants and Generalization of Some Classical Problems in Combinatorial Geometry
(2018-02-18)
In this thesis we consider extensions and generalizations of some classical problems
in Combinatorial Geometry. Our work is an offshoot of four classical problems in
Combinatorial Geometry. A fundamental assumption in these ...
Bayes Optimal Feature Selection for Supervised Learning
(2018-02-18)
The problem of feature selection is critical in several areas of machine learning and data analysis such as, for example, cancer classification using gene expression data, text categorization, etc. In this work, we consider ...
Concurrency Analysis and Mining Techniques for APIs
(2018-06-13)
Software components expose Application Programming Interfaces (APIs) as a means to access their functionality, and facilitate reuse. Developers use APIs supplied by programming languages to access the core data structures ...
Integrated Parallel Simulations and Visualization for Large-Scale Weather Applications
(2018-07-28)
The emergence of the exascale era necessitates development of new techniques to efficiently perform high-performance scientific simulations, online data analysis and on-the-fly visualization. Critical applications like ...

