Browsing Computer Science and Automation (CSA) by Title
Now showing items 341-360 of 558
-
MPCLeague: Robust MPC Platform for Privacy-Preserving Machine Learning
In the modern era of computing, machine learning tools have demonstrated their potential in vital sectors, such as healthcare and finance, to derive proper inferences. The sensitive and confidential nature of the data in ... -
Multi-Armed Bandits – On Range Searching and On Slowly-varying Non-stationarity
Multi-Armed Bandits (MAB) is a popular framework for modelling sequential decision-making problems under uncertainty. This thesis is a compilation of two independent works on MABs. 1. In the first work, we study a ... -
Multi-label Classification with Multiple Label Correlation Orders And Structures
(2018-06-18)Multilabel classification has attracted much interest in recent times due to the wide applicability of the problem and the challenges involved in learning a classifier for multilabeled data. A crucial aspect of multilabel ... -
Multi-timescale and Multi-agent Reinforcement Learning Algorithms
This thesis presents six novel works involving several research domains, such as reinforcement learning (RL)– both with or without function approximators including deep neural networks, multi-agent RL, stochastic optimization, ... -
Multimodal Deep Learning for Multi-Label Classification and Ranking Problems
(2018-06-11)In recent years, deep neural network models have shown to outperform many state of the art algorithms. The reason for this is, unsupervised pretraining with multi-layered deep neural networks have shown to learn better ... -
Multiprocessing architectures for parallel hidden surface removal algorithms
Interactive computer graphics systems have become powerful tools for man-machine interaction, with wide-ranging applications. One particularly exciting and important area is the synthetic generation of realistic images of ... -
A Nash Bargaining Based Bid Optimizer for Sponsored Search Auctions
The on-line advertising market involving displaying of Ads against search results by a search engine is growing at a fast rate. A majority of the search engine companies sell their advertising space through auctions which ... -
Near-Duplicate Detection Using Instance Level Constraints
(2011-08-09)For the task of near-duplicate document detection, comparison approaches based on bag-of-words used in information retrieval community are not sufficiently accurate. This work presents novel approach when instance-level ... -
Network Centrality Measures And Their Applications
(2014-03-03)Study of complex networks by researchers from many disciplines has provided penetrating insights on various complex systems. A study of the world wide web from a network theoretic perspective has led to the design of new ... -
Networked information discovery and retrieval on the ERNET
Networked Information Discovery and Retrieval (NIDR) is the problem of locating information that is present on a network and making use of the located information. With the increase in volume and kind of information on ... -
Neural Approaches for Natural Language Query Answering over Source Code
During software development, developers need to ensure that the developed code is bug-free and the best coding practices are followed during the code development process. To guarantee this, the developers require answers ... -
Neural Models for Personalized Recommendation Systems with External Information
Personalized recommendation systems use the data generated by user-item interactions (for example, in the form of ratings) to predict different users interests in available items and recommend a set of items or products ... -
A New Algorithm For Linear Tree Pattern Matching
(2012-05-03) -
New algorithm for linear tree pattern matching
Tree pattern matching is foundational to a wide variety of applications in Computer Science. We consider the problem of linear tree pattern matching and adopt a technique used for parsing context-free languages for this ... -
New Algorithmic and Hardness Results in Learning, Error Correcting Codes and Constraint Satisfaction Problems
Approximation algorithms are a natural way to deal with the intractability barrier that is inherent in many naturally arising computational problems. However, it is often the case that the task of solving the approximation ... -
New Approaches And Experimental Studies On - Alegebraic Attacks On Stream Ciphers
(2015-02-05)Algebraic attacks constitute an effective class of cryptanalytic attacks which have come up recently. In algebraic attacks, the relations between the input, output and the key are expressed as a system of equations and ... -
New charactrisations and algorithmic studies on chordal graphs and k-trees
A wealth of literature on graph theory has appeared in the last few centuries. This is to a large extent due to the increase in the applications of graph theory to problems of practical interest. Graph theory is also closely ... -
New Methods for Learning from Heterogeneous and Strategic Agents
(2018-05-21)1 Introduction In this doctoral thesis, we address several representative problems that arise in the context of learning from multiple heterogeneous agents. These problems are relevant to many modern applications such as ... -
New Models and Methods for Formation and Analysis of Social Networks
Social networks are an inseparable part of human lives, and play a major role in a wide range of activities in our day-to-day as well as long-term lives. The rapid growth of online social networks has enabled people to ...