Recently added

Conference Papers: Recent submissions

  • On the parameterized complexity of diverse SAT 
    Misra, Neeldhara; Mittal, Harshil; Rai, Ashutosh (2024-12-08)
    We study the Boolean Satisfiability problem (SAT) in the framework of diversity, where one asks for multiple solutions that are mutually far apart (i.e., sufficiently dissimilar from each other) for a suitable notion of ...
  • ScribGen: generating scribble art through metaheuristics 
    Debnath, Soumyaratna; Tiwari, Ashish; Raman, Shanmuganathan (Association for Computing Machinery (ACM), 2024-12-03)
    Scribble art, arising from chaos and randomness, remains one of the exceptionally attractive forms of art. Many works bridge the gap between sketches and images, but few translate images into meaningful chaotic expressions. ...
  • PythonSaga: redefining the benchmark to evaluate code generating LLMs 
    Yadav, Ankit; Beniwal, Himanshu; Singh, Mayank (Association for Computational Linguistics, 2024-11-12)
    Driven by the surge in code generation using large language models (LLMs), numerous benchmarks have emerged to evaluate these LLMs capabilities. We conducted a large-scale human evaluation of *HumanEval* and *MBPP*, two ...
  • Remember this event that year? assessing temporal information and reasoning in large language models 
    Beniwal, Himanshu; Patel, Dishant; Nandagopan D., Kowsik; Ladia, Hritik; Yadav, Ankit; Singh, Mayank (Association for Computational Linguistics, 2024-11-12)
    Large Language Models (LLMs) are increasingly ubiquitous, yet their ability to retain and reason about temporal information remains limited, hindering their application in real-world scenarios where understanding the ...
  • LEGOBENCH: scientific leaderboard generation benchmark 
    Singh, Shruti; Alam, Shoaib; Malwat, Husain; Singh, Mayank (Association for Computational Linguistics, 2024-11-12)
    The ever-increasing volume of paper submissions makes it difficult to stay informed about the latest state-of-the-art research. To address this challenge, we introduce LEGOBench, a benchmark for evaluating systems that ...
  • Envy-free and efficient allocations for graphical valuations 
    Misra, Neeldhara; Sethia, Aditi (Springer, 2024-10-14)
    We consider the complexity of finding envy-free allocations for the class of graphical valuations. Graphical valuations were introduced by Christodoulou et al. [14] as a structured class of valuations that admit allocations ...
  • Near optimal dual fault tolerant distance oracle 
    Dey, Dipan; Gupta, Manoj (2024-09-02)
    We present a dual fault-tolerant distance oracle for undirected and unweighted graphs. Given a set F of two edges, as well as a source node s and a destination node t, our oracle returns the length of the shortest path ...
  • COSAEmb: contrastive section-aware aspect embeddings for scientific articles 
    Singh, Shruti; Singh, Mayank (2024-08-16)
  • Privacy performance trade-off in web services 
    Sudhan S., Hari Hara; Hanawal, Manjesh K.; Kulkarni, Sameer G. (Institute of Electrical and Electronics Engineers (IEEE), 2024-10-08)
    Security and Privacy have become fundamental requirements of modern Internet services. Over the years, both Hypertext Transfer Protocol (HTTP) and Transport Layer Security (TLS) have evolved significantly to meet the ...
  • Demo: security vulnerabilities and network service disruptions with HTTP/3 
    Sudhan S., Hari Hara; Kulkarni, Sameer G. (Institute of Electrical and Electronics Engineers (IEEE), 2024-10-08)
    In this work, we meticulously examine and demonstrate the security vulnerabilities associated with HTTP/3 and the adversities it brings to the operations of the network services (middleboxes). HTTP/3 is built using the new ...
  • hyDNS: acceleration of DNS through kernel space resolution 
    Bardinelli, Joshua; Zhang, Yifan; Su, Jianchang; Huang, Linpu; Parilla, Aidan; Jarvi, Rachel; Kulkarni, Sameer G.; Zhang, Wei (Association for Computing Machinery (ACM), 2024-08-04)
    The Domain Name System (DNS) is a core component of Internet infrastructure, mapping domain names to IP addresses. The recursive resolver plays a critical role in this process, requiring high performance due to multiple ...
  • The group access bounds for binary search trees 
    Chalermsook, Parinya; Gupta, Manoj; Jiamjitrak, Wanchote; Pareek, Akash; Yingchareonthawornchai, Sorrachai (2024-07-08)
  • Opinion diffusion on society graphs based on approval ballots 
    Madathil, Jayakrishnan; Misra, Neeldhara; More, Yash Hiren (Association for Computing Machinery (ACM), 2024-05-06)
    A society graph, as considered by [Faliszewski et al., IJCAI 2018], is a graph corresponding to an election instance where every possible ranking is a node, and the weight of such a node is given by the number of voters ...
  • Search me knot, render me knot: embedding search and differentiable rendering of knots in 3D 
    Gangopadhyay, Aalok; Gupta, Paras; Sharma, Tarun; Singh, Prajwal; Raman, Shanmuganathan (2024-06-24)
  • DeepFrack: a comprehensive framework for layer fusion, face tiling, and efficient mapping in DNN hardware accelerators 
    Issac, Tom Glint; Pechimuthu, Mithil; Mekie, Joycee (Institute of Electrical and Electronics Engineers (IEEE), 2024-03-25)
    DeepFrack is a novel framework developed for enhancing energy efficiency and reducing latency in deep learning workloads executed on hardware accelerators. By optimally fusing layers and implementing an asymmetric tiling ...
  • The minimal faithful permutation degree of groups without Abelian normal subgroups 
    Das, Bireswar; Thakkar, Dhara (2024-06-24)
    Cayley’s theorem says that every finite group G can be viewed as a subgroup of a symmetric group Sm for some integer m. The minimal faithful permutation degree µ(G) of a finite group G is the smallest integer m such that ...
  • Nearly optimal fault tolerant distance Oracle 
    Dey, Dipan; Gupta, Manoj (Association for Computing Machinery (ACM), 2024-06-24)
    We present an f-fault tolerant distance oracle for an undirected weighted graph where each edge has an integral weight from [1 … W]. Given a set F of f edges, as well as a source node s and a destination node t, our oracle ...
  • Poster: an automated method to detect tooth brushing activity with smartwatch sensors 
    Schleter, Blake; Avdonina, Marina; Adhikary, Rishiraj; Jaisinghani, Dheryta; Sen, Sougata (Association for Computing Machinery (ACM), 2024-06-03)
    Oral diseases affect an estimated 3.5 billion people globally, posing significant health challenges. According to the World Health Organization (WHO), adopting self-care practices and maintaining personal oral hygiene can ...
  • How robust are the tabular QA models for scientific tables? a study using customized dataset 
    Ghosh, Akash; Sahith, B. Venkata; Ganguly, Niloy; Goyal, Pawan; Singh, Mayank (2024-05-20)
    Question-answering (QA) on hybrid scientific tabular and textual data deals with scientific information, and relies on complex numerical reasoning. In recent years, while tabular QA has seen rapid progress, understanding ...
  • MineCPP: mining bug fix pairs and their structures 
    Avula, Sai Krishna; Mondal, Shouvick (2024-07-15)

Search Digital Repository


Browse

My Account