Browsing Computer Science and Automation (CSA) by Title
Now showing items 265-284 of 394
-
New Techniques for Automatic Short Answer Grading
Assessing acquired knowledge by students is one of the key aspects of the pedagogical ecosystem. A significant part of a teacher’s time is spent towards grading responses of students to questions given in assignments and ... -
Non-Parametric Clustering of Multivariate Count Data
(2018-05-23)The focus of this thesis is models for non-parametric clustering of multivariate count data. While there has been significant work in Bayesian non-parametric modelling in the last decade, in the context of mixture models ... -
A Nonlinear Stochastic Optimization Framework For RED
(2011-09-23) -
Novel Algorithms for Improving Agricultural Planning and Operations using Artificial Intelligence and Game Theory
This dissertation work is motivated by the critical need to address a perennial global problem, namely, how to mitigate the distress of the small and marginal agricultural farmers in emerging economies. Key reasons behind ... -
Novel First-order Algorithms for Non-smooth 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 non-smooth ... -
A Novel Game Theoretic And Voting Mechanism Based Approach For Carbon Emissions Reduction
(2014-08-07)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
(2012-04-20)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 Multi-Hop 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 Sentiment-oriented Aspect-Opinion Pair Extraction
Over the years, fine-grained 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: NUMA-aware Memory De-duplication for Multi-socket 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
(2018-06-21)This thesis introduces a new mathematical object: collection of arithmetic progressions with elements satisfying the inverse property, \j-th terms of i-th and (i+1)-th progressions are multiplicative inverses of each other ... -
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 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 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 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 ...