Computer Science and Automation (CSA): Recent submissions
Now showing items 361-380 of 542
-
Parameterized Complexity of Maximum Edge Coloring in Graphs
(2018-03-09)The classical graph edge coloring problem deals in coloring the edges of a given graph with minimum number of colors such that no two adjacent edges in the graph, get the same color in the proposed coloring. In the following ... -
An Optimizing Code Generator for a Class of Lattice-Boltzmann Computations
(2018-03-09)Lattice-Boltzmann method(LBM), a promising new particle-based simulation technique for complex and multiscale fluid flows, has seen tremendous adoption in recent years in computational fluid dynamics. Even with a ... -
A Systems Perspective of Software Runtime Bloat - Origin, Mitigation and Power-Performance Implications
(2018-03-08)Large flexible software systems tend to incur “bloat”, here defined as the runtime overhead induced by the accumulation of excess functionality and objects. Removing bloat is hard as these overheads are a side-effect of ... -
Online Learning and Simulation Based Algorithms for Stochastic Optimization
(2018-03-07)In many optimization problems, the relationship between the objective and parameters is not known. The objective function itself may be stochastic such as a long-run average over some random cost samples. In such cases ... -
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 ... -
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 ... -
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 ... -
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 ... -
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 ... -
Hitting Geometric Range Spaces using a Few Points
(2018-02-15)A range space (P, S) consists of a set P of n elements and a collection S = {S1,...,Sm} of subsets of P , referred to as ranges. A hitting set for this range space refers to a subset H of P such that every Si in S contains ... -
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 ... -
On Learning k-Parities and the Complexity of k-Vector-SUM
(2018-02-06)In this work, we study two problems: first is one of the central problem in learning theory of learning sparse parities and the other k-Vector-SUM is an extension of the not oriousk-SUM problem. We first consider the problem ... -
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 ... -
Morse-Smale Complexes : Computation and Applications
(2018-01-30)In recent decades, scientific data has become available in increasing sizes and precision. Therefore techniques to analyze and summarize the ever increasing datasets are of vital importance. A common form of scientific ... -
Power Issues in SoCs : Power Aware DFT Architecture and Power Estimation
(2018-01-10)Test power, data volume, and test time have been long-standing problems for sequential scan based testing of system-on-chip (SoC) design. The modern SoCs fabricated at lower technology nodes are complex in nature, the ... -
Symmetry in Scalar Fields
(2018-01-09)Scalar fields are used to represent physical quantities measured over a domain of interest. Study of symmetric or repeating patterns in scalar fields is important in scientific data analysis because it gives deep insights ... -
Game-Theoretic Analysis of Strategic Behaviour in Networks, Crowds and Classrooms
(2018-01-03)Over the past decade, the explosive growth of the Internet has led to a surge of interest to understand and predict aggregate behavior of large number of people or agents, particularly when they are connected through an ... -
Consistency of Spectral Algorithms for Hypergraphs under Planted Partition Model
(2018-01-01)Hypergraph partitioning lies at the heart of a number of problems in machine learning as well as other engineering disciplines. While partitioning uniform hypergraphs is often required in computer vision problems that ... -
Targeted Client Synthesis for Detecting Concurrency Bugs
(2018-01-01)Detecting concurrency bugs can be challenging due to the intricacies associated with their manifestation. These intricacies correspond to identifying the methods that need to be invoked concurrently, the inputs passed to ... -
A Case for Protecting Huge Pages from the Kernel
(2018-01-01)Modern architectures support multiple size pages to facilitate applications that use large chunks of contiguous memory either for buffer allocation, application specific memory management, in-memory caching or garbage ...