Browsing Computer Science and Automation (CSA) by Title
Now showing items 373-392 of 552
-
Numerical integration of ordinary differential equation on multiprocessing systems
In this thesis, we explore how to solve Ordinary Differential Equations (ODEs) on parallel computers. A comprehensive study of the current state-of-the-art methods for both sequential and parallel integration of ODEs is ... -
Object cache : a dynamically configurable and energy efficient cache architecture for embedded systems
Object-oriented programming languages provide a rich set of features that provide significant software engineering benefits. The increased productivity provided by these features comes at a justifiable cost of complexity ... -
Object-Oriented software engineering of a compiler prototyp-ing system
A compiler consists of two phases: source program analysis and object program generation. The problem of compilation has been extensively studied and many tools and techniques for building the analysis phase are available. ... -
On A Cubic Sieve Congruence Related To The Discrete Logarithm Problem
(2013-05-21)There has been a rapid increase interest in computational number theory ever since the invention of public-key cryptography. Various attempts to solve the underlying hard problems behind public-key cryptosystems has led ... -
On algebraic and analytic properties of polynomials over finite fields
In this work, we provide some new interesting results in the emerging theory of higher-order Fourier analysis. The goal of this theory is to understand the connection between the algebraic structure and analytic properties ... -
On Dimensional Parameters Of Graphs And Posets
(2013-06-21)In this thesis we study the following dimensional parameters : boxicity, cubicity, threshold dimension and poset dimension. While the first three parameters are defined on graphs, poset dimension is defined on partially ... -
On Generalized Measures Of Information With Maximum And Minimum Entropy Prescriptions
(2008-01-29)Kullback-Leibler relative-entropy or KL-entropy of P with respect to R defined as ∫xlnddPRdP , where P and R are probability measures on a measurable space (X, ), plays a basic role in the definitions 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 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 ... -
On Orbits and Border of Constant Read Circuits and Lower Bounds for Constant Depth Circuits
Two of the most common ways in which arithmetic circuits can be restricted is by requiring that they be constant read or constant depth. Constant depth circuits have received a lot of attention in the arithmetic circuit ... -
On Policy Gradients, Momentum, and Learning with Adversaries: Algorithms and Convergence Analysis
This thesis comprises five works, organized into three parts: the first focuses on average-reward Reinforcement Learning (RL), the second on distributed learning under adversaries in heterogeneous and asynchronous setups, ... -
On some themes and models in economics (with a case-study in management)
The case study has sought to draw attention to the fact that historical factors have a strong impact on the structure and behaviour of a company. In the case of HMT, some of these factors were the association with the ... -
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
(2013-06-14)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 expressiveness of metric temporal logic
Temporal Logics are a popular formalism for specification of properties in the verification of reactive systems. They can be employed to reason about the behavior of systems with the evolution of time. For example, one can ... -
On the Round Complexity Landscape of Secure Multi-party Computation
In secure multi-party 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 ... -
On-Line tamil characater recognition using neural networks
In this thesis, we design a neural network-based online Tamil character recognition system. The thesis focuses on the following areas: Character representation, Neural network architecture, and Training algorithms for ... -
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 ... -
Online Optimization Of RED Routers
(2011-04-25) -
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 co-running applications. However, it creates a layer of indirection in the ...