Browsing E-print Articles by Title

Browsing E-print Articles by Title

Sort by: Order: Results:

  • k-means subclustering: a differentially private algorithm with improved clustering quality 
    Joshi, Devvrat; Thakkar, Janvi (Cornell University Library, 2023-01)
    In today's data-driven world, the sensitivity of information has been a significant concern. With this data and additional information on the person's background, one can easily infer an individual's private data. Many ...
  • Karchmer-Wigderson games for hazard-free computation 
    Ikenmeyer, Christian; Komarath, Balagopal; Saurabh, Nitin (Cornell University Library, 2021-07)
    We present a Karchmer-Wigderson game to study the complexity of hazard-free formulas. This new game is both a generalization of the monotone Karchmer-Wigderson game and an analog of the classical Boolean Karchmer-Wigderson ...
  • Maximum Matchings via Glauber Dynamics 
    Jindal, Anant; Kochar, Gazal; Pal, Manjish (arXiv, Cornell University Library, 2011-07)
    In this paper we study the classic problem of computing a maximum cardinality matching in general graphs G=(V,E). The best known algorithm for this problem till date runs in O(mn√) time due to Micali and Vazirani \cite{MV80}. ...
  • Merged-GHCIDR: geometrical approach to reduce image data 
    Joshi, Devvrat; Thakkar, Janvi; Soni, Siddharth; Mody, Shril; Patil, Rohan; Batra, Nipun (Cornell University Library, 2022-09)
    The computational resources required to train a model have been increasing since the inception of deep networks. Training neural networks on massive datasets have become a challenging and time-consuming task. So, there ...
  • MIPE: a Metric Independent Pipeline for Effective code-mixed NLG evaluation 
    Garg, Ayush; Kagi, Sammed Shantinath; Srivastava, Vivek; Singh, Mayank (Cornell University Library, 2021-07)
    Code-mixing is a phenomenon of mixing words and phrases from two or more languages in a single utterance of speech and text. Due to the high linguistic diversity, code-mixing presents several challenges in evaluating ...
  • Multiple source dual fault tolerant BFS trees 
    Gupta, Manoj; Khan, Shahbaz (Cornell University Library, 2017-04)
  • Multiple source replacement path problem 
    Gupta, Manoj; Jain, Rahul; Modi, Nitiksha (Cornell University Library, 2020-05)
    One of the classical line of work in graph algorithms has been the Replacement Path Problem: given a graph G, s and t, find shortest paths from s to t avoiding each edge e on the shortest path from s to t. These paths are ...
  • Neural encoding of songs is modulated by their enjoyment 
    Sharma, Gulshan; Pandey, Pankaj; Subramanian, Ramanathan; Miyapuram, Krishna Prasad; Dhall, Abhinav (Cornell University Library, 2022-08)
    We examine user and song identification from neural (EEG) signals. Owing to perceptual subjectivity in human-media interaction, music identification from brain signals is a challenging task. We demonstrate that subjective ...
  • A new approach to deanonymization of unreachable bitcoin nodes 
    Mastan, Indra Deep; Paul, Souradyuti (International Association for Cryptologic Research, 2018-03)
    Mounting deanonymization attacks on the unreachable Bitcoin nodes -- these nodes do not accept incoming connections -- residing behind the NAT is a challenging task. Such an attack was first given by Biryukov, Khovratovich ...
  • NLPExplorer: exploring the universe of NLP papers 
    Parmar, Monarch; Jain, Naman; Jain, Pranjali; Sahit, P. Jayakrishna; Pachpande, Soham; Singh, Shruti; Singh, Mayank (Cornell University Library, 2019-10)
    Understanding the current research trends, problems, and their innovative solutions remains a bottleneck due to the ever-increasing volume of scientific articles. In this paper, we propose NLPExplorer, a completely automatic ...
  • Non-clairvoyant scheduling of coflows 
    Bhimaraju, Akhil; Nayak, Debanuj; Vaze, Rahul (Cornell University Library, 2020-04)
    The coflow scheduling problem is considered: given an input/output switch with each port having a fixed capacity, find a scheduling algorithm that minimizes the weighted sum of the coflow completion times respecting the ...
  • On additive approximate submodularity 
    Chierichetti, Flavio; Dasgupta, Anirban; Kumar, Ravi (Cornell University Library, 2020-10)
  • On adversarial robustness of synthetic code generation 
    Anand, Mrinal; Kayal, Pratik; Singh, Mayank (Cornell University Library, 2021-06)
    Automatic code synthesis from natural language descriptions is a challenging task. We witness massive progress in developing code generation systems for domain-specific languages (DSLs) employing sequence-to-sequence deep ...
  • On coresets for regularized regression 
    Chhaya, Rachit; Dasgupta, Anirban; Shit, Supratim (Cornell University Library, 2020-06)
  • On fair division with binary valuations respecting social networks 
    Misra, Neeldhara; Nayak, Debanuj (Cornell University Library, 2021-11)
    We study the computational complexity of finding fair allocations of indivisible goods in the setting where a social network on the agents is given. Notions of fairness in this context are "localized", that is, agents are ...
  • On structural parameterizations of firefighting 
    Das, Bireswar; Enduri, Murali Krishna; Misra, Neeldhara; Reddy, I. Vinod (Cornell University Library, 2017-11)
    The Firefighting problem is defined as follows. At time t=0, a fire breaks out at a vertex of a graph. At each time step t?0, a firefighter permanently defends (protects) an unburned vertex, and the fire then spread to all ...
  • On the complexity of winner verification and candidate winner for multiwinner voting rules 
    Sonar, Chinmay; Dey, Palash; Misra, Neeldhara (Cornell University Library, 2020-04)
    The Chamberlin-Courant and Monroe rules are fundamental and well-studied rules in the literature of multi-winner elections. The problem of determining if there exists a committee of size k that has a Chamberlin-Courant ...
  • On the parallel parameterized complexity of the graph isomorphism problem 
    Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod (Cornell University Library, 2017-12)
    In this paper, we study the parallel and the space complexity of the graph isomorphism problem (\GI{}) for several parameterizations. Let H={H1,H2,?,Hl} be a finite set of graphs where |V(Hi)|?d for all i and for some ...
  • Online coresets for clustering with Bregman divergences 
    Chhaya, Rachit; Choudhari, Jayesh; Dasgupta, Anirban; Shit, Supratim (Cornell University Library, 2020-12)
    We present algorithms that create coresets in an online setting for clustering problems according to a wide subset of Bregman divergences. Notably, our coresets have a small additive error, similar in magnitude to the ...
  • Parameterized algorithms for conflict-free colorings of graphs 
    Reddy, I. Vinod (Cornell University Library, 2017-09)
    In this paper, we study the conflict-free coloring of graphs induced by neighborhoods. A coloring of a graph is conflict-free if every vertex has a uniquely colored vertex in its neighborhood. The conflict-free coloring ...

Search Digital Repository


Browse

My Account