DSpace at Indian Statistical Institute: Recent submissions

  • Essays on Games and Decisions 
    Chatterjee, Siddharth (Indian Statistical Institute, Delhi, 2022-07)
    In the first chapter, a solution concept for two-person zero-sum games is proposed with players' preferences only assumed to satisfy Independence. To each player, there is a set of "admissible" strategies assuring him ...
  • Weighted inequalities for maximal operators and the Hardy space H1 on LCA groups 
    Md Nurul Molla (Indian Statistical Institute, Kolkata, 2023-02)
    The purpose of this thesis is two fold: to study weighted norm inequalities for maximal type operators such as Hardy{Littlewood maximal operator associated with a family of general sets in a topological space and ...
  • Tridiagonal shifts and Analytic perturbation 
    Das, Susmita (Indian Statistical Institute, Bangalore, 2022-12)
    Abstract -
  • 57 Convocation Address 
    Spiegelhalter, David John (Indian Statistical Institute, 2023-01-31)
  • Secure Off-chain Transactions in Blockchain-based Payment Channel Networks 
    Mazumdar, Subhra (Indian Statistical Institute, Kolkata, 2022-09)
    Cryptocurrencies enable users to execute a financial transaction without relying on any third party. The use of Blockchain technology guarantees the security and immutability of transactions. Despite these features, ...
  • From Model to Person Virtual Try-On of Clothes 
    Roy, Debapriya (Indian Statistical Institute, Kolkata, 2022-02)
    Virtual Try-On (VTON) is an Augmented Reality (AR) application that allows a user to try a product before actually buying it. In this work, we explore VTON approaches in the clothing domain. Considering the cost intensiveness ...
  • A Pass Prediction System Derived from the Broadcasting Soccer Video 
    Sanyal, Samriddha (Indian Statistical Institute, Kolkata, 2022-09)
    In soccer, the most frequent event that occurs is a pass. For a trained eye, there are a myriad of adjectives which could describe the possible pass (e.g.,"majestic pass", "conservative" to "poor-ball"). During the game, ...
  • Analysis and Design of Quantum Secure Communication System 
    Das, Nayana (Indian Statistical Institute, Kolkata, 2022-08)
    Quantum secure direct communication (QSDC) is an important branch of quantum cryptog- raphy, where one can transmit a secret message securely without encrypting it by a prior key. Quantum dialogue (QD) is a process of ...
  • Robust Inference using the Extended Bregman Divergence and Optimal Tuning Parameter Selection 
    Basak, Sancharee (Indian Statistical Institute, Kolkata, 2022-07)
    The inference procedure based on the minimization of statistical distances has already proved to be a very useful tool in the field of robust inference. One of such commonly used divergences is the Bregman Divergence. ...
  • Aspects of Quantum Entanglement and Indistinguishability 
    Das, Soumya (Indian Statistical Institute, Kolkata, 2022-08)
    Entanglement of distinguishable and indistinguishable particles under different sce- narios and related properties and results constitute the core component of this thesis. We propose a new error-modeling for Hardy’s ...
  • Adaptation-Based Classi ers for Handling Some Problems with Multi-Label Data 
    Law, Anwesha (Indian Statistical Institute, Kolkata, 2022-06)
    The concept of multi-label (ML) data generalizes the association of instances to classes by labelling each data sample with more than one class simultaneously. Since this data can belong to more than one class at the same ...
  • Hardness and pproximation of some Graph Theoretic problems 
    Chatterjee, Diptendu (Indian Statistical Institute, Kolkata, 2022-07)
    In the real world, we encounter many problems that can be modeled as graphtheoretic problems. This modeling gives a concrete view of the constraints and objectives of the problem and allows us to apply some well-known ...
  • On Finding Optimal Sub-structures in Graphs 
    Dey, Sanjana (Indian Statistical Institute, Kolkata, 2022-07)
    In computer science, a problem is said to have an optimal sub-structure if an optimal solution can be constructed from optimal solutions of its sub-problems. These optimal sub-structures are computed in the classical ...
  • Contextual Answer Validation 
    Baksi, Arkadeep (Indian Statistical Institute, Kolkata, 2022-07)
    Answer generation for a question, given a context has gained tremendous popularity in the NLP research space. Benchmark datasets like SQuAD[9] have propelled the research and recent years have seen many transformer based ...
  • Study of some graph theoretic problems via vertex orderings 
    Jacob, Dalu (Indian Statistical Institute. Chennai, 2022-06)
    Graph traversal algorithms like breadth-first search and depth-first search typically produce an ordering of the vertices of the input graph. Properties of these vertex orderings often provide new insights about the ...
  • Commuting tuples of operators and functions in the Schur-Agler class 
    Debnath, Ramlal (Indian Statistical Institute, Bangalore, 2022-05)
    Ab
  • A Last Progeny Modified Branching Random Walk 
    Ghosh, Partha Pratim (Indian Statistical Institute, New Delhi, 2022-05)
    In this work, we consider a modification of the usual Branching Random Walk (BRW), where we give certain independent and identically distributed (i.i.d.) displacements to all the particles at the n-th generation, which may ...
  • Experiments In Statistical Sampling In The Indian Statistical Institute 
    Mahalanobis, P.C. (Statistical Publishing Society, 1961)
  • Essays on sequencing problems with welfare bounds 
    Banerjee, Sreoshi (Indian Statistical Institute, Kolkata, 2021-07)
    This is a comprehensive study of sequencing problems with welfare bounds. The sequencing frame- work comprises a finite set of agents and a single facility provider that processes their jobs sequentially. Each job is ...
  • Horizontal, Contact and Partially Horizontal Immersions in Fat Distributions 
    Bhowmick, Aritra (Indian Statistical Institute, Kolkata, 2021-06)
    In this thesis we study Gromov's h-Principle in the context of immersions horizontal to a given distribution. We prove Gromov's overregularity theorem in full generality and extend it to other classes of maps, e.g, isocontact ...