Recently added

E-print Articles: Recent submissions

  • Shukla, Praveen Kumar; Cecotti, Hubert; Meena, Yogesh Kumar (Cornell University Library, 2024-10)
    Brain-computer interfaces (BCIs) enable direct interaction between users and computers by decoding brain signals. This study addresses the challenges of detecting P300 event-related potentials in electroencephalograms ...
  • Etikikota, Hrushikesh; Meena, Yogesh Kumar (Cornell University Library, 2024-10)
    On-screen keyboard eye-typing systems are limited due to the lack of predictive text and user-centred approaches, resulting in low text entry rates and frequent recalibration. This work proposes integrating the prediction ...
  • Cecotti, Hubert; Dhaliwal, Dalvir; Singh, Hardip; Meena, Yogesh Kumar (Cornell University Library, 2024-10)
    Post-training quantization (PTQ) is a technique used to optimize and reduce the memory footprint and computational requirements of machine learning models. It has been used primarily for neural networks. For Brain-Computer ...
  • Benson, Deepu; Das, Bireswar; Dey, Dipan; Ghosh, Jinia (Cornell University Library, 2024-09)
    In this paper, we study the oriented diameter of power graphs of groups. We show that a 2-edge connected power graph of a finite group has oriented diameter at most 4. We prove that the power graph of a cyclic group of ...
  • Sheth, Rajvee; Nisar, Shubh; Prajapati, Heenaben; Beniwal, Himanshu; Singh, Mayank (Cornell University Library, 2024-08)
    As the NLP community increasingly addresses challenges associated with multilingualism, robust annotation tools are essential to handle multilingual datasets efficiently. In this paper, we introduce a code-mixed multilingual ...
  • Pareek, Akash (Cornell University Library, 2024-07)
    The (preorder) traversal conjecture states that starting with an initial tree, the cost to search a sequence S=(s1,s2,…,sn)∈[n]n in a binary search tree (BST) algorithm is O(n), where S is obtained by a preorder traversal ...
  • Dey, Dipan; Gupta, Manoj (Cornell University Library, 2024-07)
    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 ...
  • Madathil, Jayakrishnan; Misra, Neeldhara; Sethia, Aditi (Cornell University Library, 2024-06)
    We study almost-envy-freeness in house allocation, where m houses are to be allocated among n agents so that every agent receives exactly one house. An envy-free allocation need not exist, and therefore we may have to ...
  • Pandey, Pankaj; Jha, Aditi; Miyapuram, Krishna Prasad; Lomas, Derek (Institute of Electrical and Electronics Engineers (IEEE), 2024-06)
    Research in music perception and brain activity has led to the development of Music Brain-Computer Interface Systems. While previous studies have focused on aspects such as song identification, stimulus-response correlation, ...
  • Mondal, Rishabh; Dubey, Shataxi; Jani, Vannsh; Shah, Shrimay; Jaiswal, Suraj; Patel, Zeel B.; Batra, Nipun (Cornell University Library, 2024-06)
    Air pollution kills 7 million people annually. The brick manufacturing industry accounts for 8%-14% of air pollution in the densely populated Indo-Gangetic plain. Due to the unorganized nature of brick kilns, policy violation ...
  • Liu, Wei; Mondal, Shouvick; Chen, Tse-Hsun (Peter) (Cornell University Library, 2024-05)
  • Sharma, Anupam; Miyapuram, Krishna Prasad (Cornell University Library, 2024-04)
    Electroencephalography (EEG) classification is a versatile and portable technique for building non-invasive Brain-computer Interfaces (BCI). However, the classifiers that decode cognitive states from EEG brain data perform ...
  • Ghosh, Akash; Sahith, B. Venkata; Ganguly, Niloy; Goyal, Pawan; Singh, Mayank (Cornell University Library, 2024-03)
    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 ...
  • Beniwal, Himanshu; Nandagopan D., Kowsik; Singh, Mayank (Cornell University Library, 2024-02)
    Large Language Models (LLMs) are increasingly becoming ubiquitous, yet their ability to reason about and retain temporal information remains limited. This hinders their application in real-world scenarios where understanding ...
  • Dey, Dipan; Gupta, Manoj (Cornell University Library, 2024-02)
    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 ...
  • Singh, Shruti; Gupta, Rishabh (Cornell University Library, 2024-02)
    Computation of document similarity is a critical task in various NLP domains that has applications in deduplication, matching, and recommendation. Traditional approaches for document similarity computation include learning ...
  • Beniwal, Himanshu; Nandagopan D, Kowsik; Singh, Mayank (Cornell University Library, 2024-01)
    The training of large language models (LLMs) necessitates substantial data and computational resources, and updating outdated LLMs entails significant efforts and resources. While numerous model editing techniques (METs) ...
  • Singh, Shruti; Alam, Shoaib; Singh, Mayank (Cornell University Library, 2024-01)
    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 ...
  • Yadav, Ankit; Singh, Mayank (Cornell University Library, 2024-01)
    Motivated by the increasing popularity of code generation from human descriptions using large language models (LLMs), several benchmarks have been proposed to assess the capabilities of existing and emerging models. This ...
  • Chalermsook, Parinya; Gupta, Manoj; Jiamjitrak, Wanchote; Pareek, Akash; Yingchareonthawornchai, Sorrachai (Cornell University Library, 2023-12)

Search Digital Repository


Browse

My Account