Browsing Computer Science and Automation (CSA) by Title
Now showing items 2948 of 354

Analysis Of A Sieving Heuristic For The Number Field Sieve And Design Of LowCorrelation CDMA Sequences
(20110125)In this thesis, we investigate in detail, certain important problems in cryptography and coding theory. In the first part of this thesis, we discuss the number field sieve and compare the two ways in which the sieving ... 
Approximate Dynamic Programming and Reinforcement Learning  Algorithms, Analysis and an Application
(20180813)Problems involving optimal sequential making in uncertain dynamic systems arise in domains such as engineering, science and economics. Such problems can often be cast in the framework of Markov Decision Process (MDP). ... 
Approximation Algorithms for Geometric Packing and Covering Problems
We study a host of geometric optimization problems that are NPhard and design polynomial time approximation algorithms for them. More precisely, we are given a family of geometric objects and a point set, mostly in the ... 
Approximation Algorithms for Geometric Packing Problems
We study approximation algorithms for the geometric bin packing problem and its variants. In the twodimensional geometric bin packing problem (2D GBP), we are given n rectangular items and we have to compute an axisparallel ... 
Architecture Descriptions for Retargetable Code Translation
(Indian Institute of Science, 20050314)The study of architectural parameterization has long neglected other parameterizations in favour of code selector descriptions. In this dissertation, we are concerned with providing linguistic notations for modelling ... 
Architecture, Performance and Applications of a Hierarchial Network of Hypercubes
(Indian Institute of Science, 20050209)This thesis, presents a multiprocessor topology, the hierarchical network of hypercubes, which has a low diameter, low degree of connectivity and yet exhibits hypercube like versatile characteristics. The hierarchical ... 
Automated Test Generation and Performance Improvement using Dynamic Program Analysis
Software development process consists of various stages like design, implementation, and testing. Since programmers are considerably involved in these stages, their intuition and expertise play a vital role in the success ... 
Automatic Data Allocation, Buffer Management And Data Movement For MultiGPU Machines
(20170524)MultiGPU machines are being increasingly used in high performance computing. These machines are being used both as standalone work stations to run computations on medium to large data sizes (tens of gigabytes) and as a ... 
Automatic Data Partitioning By Hierarchical Genetic Search
(Indian Institute of Science, 20051207)The introduction of languages like High Performance Fortran (HPF) which allow the programmer to indicate how the arrays used in the program have to be distributed across the local memories of a multicomputer has not ... 
Automatic Optimization of Geometric Multigrid Methods using a DSL Approach
(20180614)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 ... 
Automatic Storage Optimization of Arrays Affine Loop Nests
(20180301)Efficient memory usage is crucial for dataintensive 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 ... 
Autonomous Spacecraft Mission Planning And Execution In A Petri Net Framework
(20140801)Presently, most spacecraft are controlled from ground involving activities such as uplinking the schedule of daily operations and monitoring health parameters. These activities lead to a cognitive overload on human ... 
Battle of Bandits: Online Learning from Subsetwise Preferences and Other Structured Feedback
The elicitation and aggregation of preferences is often the key to making better decisions. Be it a perfume company wanting to relaunch their 5 most popular fragrances, a movie recommender system trying to rank the most ... 
Bayes Optimal Feature Selection for Supervised Learning
(20180218)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 ... 
Bayesian Nonparametric Modeling of Temporal Coherence for EntityDriven Video Analytics
(20180514)In recent times there has been an explosion of online usergenerated video content. This has generated significant research interest in video analytics. Human users understand videos based on highlevel semantic ... 
Boolean Functional Synthesis using Gated Continuous Logic Networks
Boolean Functional Synthesis (BFS) is a wellknown challenging problem in the domain of automated program synthesis from logical specifications. This problem aims to synthesize a Boolean function that is correctbyconstruction ... 
Bounds On Augmented Automata And Quantum Adiabatic Optimization
(20090525)Quantum computing has generated a lot of interested in the past two decades. Research into powerful models of quantum computation has yielded important and elegant results like an efficient algorithm for factoring and a ... 
Boxicity And Cubicity : A Study On Special Classes Of Graphs
(20140602)Let F be a family of sets. A graph G is an intersection graph of sets from the family F if there exists a mapping f : V (G)→ F such that, An interval graph is an intersection graph of a family of closed intervals on the ... 
Boxicity, Cubicity And Vertex Cover
(20100928)The boxicity of a graph G, denoted as box(G), is the minimum dimension d for which each vertex of G can be mapped to a ddimensional axisparallel box in Rd such that two boxes intersect if and only if the corresponding ... 
A Broadcast CubeBased Multiprocessor Architecture for Solving Partial Differential Equations
(Indian Institute of Science, 20050126)A large number of mathematical models in engineering and physical sciences employ Partial Differential Equations (PDEs). The sheer number of operations required in numerically integrating PDEs in these applications has ...