Browsing Computer Science and Automation (CSA) by Title
Now showing items 246265 of 362

Novel Firstorder Algorithms for Nonsmooth Optimization Problems in Machine Learning
This thesis is devoted to designing efficient optimization algorithms for machine learning (ML) problems where the underlying objective function to be optimized is convex but not necessarily differentiable. Such nonsmooth ... 
A Novel Game Theoretic And Voting Mechanism Based Approach For Carbon Emissions Reduction
(20140807)Global warming is currently a major challenge facing the world. There are widespread ongoing efforts in the form of summits, conferences, etc., to find satisfactory ways of surmounting this challenge. The basic objective ... 
Novel Mechanisms For Allocation Of Heterogeneous Items In Strategic Settings
(20120420)Allocation of objects or resources to competing agents is a ubiquitous problem in the real world. For example, a federal government may wish to allocate different types of spectrum licenses to telecom service providers; a ... 
Novel Neural Architecture for MultiHop Question Answering
Natural language understanding has been one of the key drivers responsible for advancing the eld of AI. To this end, automated Question Answering (QA) has served as an effective way of measuring the language understanding ... 
A Novel Neural Network Architecture for Sentimentoriented AspectOpinion Pair Extraction
Over the years, finegrained opinion mining in online reviews has received great attention from the NLP research community. It involves different tasks such as Aspect Term Extraction (ATE), Opinion Term Extraction (OTE), ... 
Novel Reinforcement Learning Algorithms and Applications to Hybrid Control Design Problems
The thesis is a compilation of two independent works. In the first work, we develop novel weight assignment procedure, which helps us develop several schedule based algorithms. Learning the value function of a given policy ... 
nuKSM: NUMAaware Memory Deduplication for Multisocket Servers
An operating system's memory management has multiple goals, e.g. reducing memory access latencies, reducing memory footprint. These goals can conflict with each other when independent subsystems optimize them in silos. ... 
Number Theoretic, Computational and Cryptographic Aspects of a Certain Sequence of Arithmetic Progressions
(20180621)This thesis introduces a new mathematical object: collection of arithmetic progressions with elements satisfying the inverse property, \jth terms of ith and (i+1)th progressions are multiplicative inverses of each other ... 
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 ...