Browsing Computer Science and Automation (CSA) by Title
Now showing items 245264 of 349

On A Cubic Sieve Congruence Related To The Discrete Logarithm Problem
(20130521)There has been a rapid increase interest in computational number theory ever since the invention of publickey cryptography. Various attempts to solve the underlying hard problems behind publickey cryptosystems has led ... 
On Dimensional Parameters Of Graphs And Posets
(20130621)In this thesis we study the following dimensional parameters : boxicity, cubicity, threshold dimension and poset dimension. While the ﬁrst three parameters are defined on graphs, poset dimension is defined on partially ... 
On Generalized Measures Of Information With Maximum And Minimum Entropy Prescriptions
(20080129)KullbackLeibler relativeentropy or KLentropy of P with respect to R deﬁned as ∫xlnddPRdP , where P and R are probability measures on a measurable space (X, ), plays a basic role in the deﬁnitions of classical information ... 
On Learning and Lower Bound Problems Related to the Iterated Matrix Multiplication Polynomial
The iterated matrix multiplication polynomial (IMM) of width w and length d is the 1x1 entry in the product of d square matrices of size w. The w^2d entries in the d matrices are distinct variables. In this thesis, we study ... 
On Learning kParities and the Complexity of kVectorSUM
(20180206)In this work, we study two problems: first is one of the central problem in learning theory of learning sparse parities and the other kVectorSUM is an extension of the not oriouskSUM problem. We first consider the problem ... 
On symmetries of and equivalence tests for two polynomial families and a circuit class
Two polynomials f, g ∈ F[x1, . . . , xn] over a field F are said to be equivalent if there exists an n×n invertible matrix A over F such that g = f(Ax), where x = (x1 · · · xn)T . The equivalence test (in short, ET) for ... 
On The Complexity Of Grobner Basis And Border Basis Detection
(20130614)The theory of Grobner bases has garnered the interests of a large number of researchers in computational algebra due to its applications not only in mathematics but also in areas like control systems, robotics, cryptography ... 
On the Round Complexity Landscape of Secure Multiparty Computation
In secure multiparty computation (MPC), n parties wish to jointly perform a computation on their private inputs in a secure way, so that no adversary corrupting a subset of the parties can learn more information than their ... 
Online Learning and Simulation Based Algorithms for Stochastic Optimization
(20180307)In many optimization problems, the relationship between the objective and parameters is not known. The objective function itself may be stochastic such as a longrun average over some random cost samples. In such cases ... 
Online Optimization Of RED Routers
(20110425) 
Operating System Support for Efficient Virtual Memory
Computers rely on the virtual memory abstraction to simplify programming, portability, physical memory management and ensure isolation among corunning applications. However, it creates a layer of indirection in the ... 
Optimization Algorithms for Deterministic, Stochastic and Reinforcement Learning Settings
(20180530)Optimization is a very important field with diverse applications in physical, social and biological sciences and in various areas of engineering. It appears widely in machine learning, information retrieval, regression, ... 
Optimizations In Storage Area Networks And Direct Attached Storage
(20090723)The thesis consists of three parts. In the first part, we introduce the notion of devicecacheaware schedulers. Modern disk subsystems have many megabytes of memory for various purposes such as prefetching and caching. ... 
An Optimizing Code Generator for a Class of LatticeBoltzmann Computations
(20180309)LatticeBoltzmann method(LBM), a promising new particlebased simulation technique for complex and multiscale fluid flows, has seen tremendous adoption in recent years in computational fluid dynamics. Even with a ... 
Optimizing Dense Matrix Computations with PolyMage
Linear algebra computations and other arbitrary affine accesses are ubiquitous in applications from domains like scientific computing, digital signal processing (DSP), and deep neural networks. Libraries such as OpenBLAS, ... 
Outlier Detection with Applications in Graph Data Mining
(20180424)Outlier detection is an important data mining task due to its applicability in many contemporary applications such as fraud detection and anomaly detection in networks, etc. It assumes significance due to the general ... 
P3 : An Effective Technique for Partitioned Path Profiling
Acyclic path profile is an abstraction of dynamic control flow paths of procedures and has been found to be useful in a wide spectrum of activities. Unfortunately, the runtime overhead of obtaining such a profile can be ... 
A Parallelizing Compiler for Fortran
(Indian Institute of Science, 20050309)With the advent of Distributed Memory Machines (DMMs) numerous work have been undertaken to ease the work of a programmer these systems. Data parallel languages like Fortran D, Vienna Fortran, High Performance Fortran and ... 
Parameterized Complexity of Maximum Edge Coloring in Graphs
(20180309)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 ...