Browsing E-print Articles by Title

Browsing E-print Articles by Title

Sort by: Order: Results:

  • 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 ...
  • The parameterized complexity of happy colorings 
    Misra, Neeldhara; Reddy, I. Vinod (Cornell University Library, 2017-08)
    Consider a graph G=(V,E) and a coloring c of vertices with colors from [ℓ]. A vertex v is said to be happy with respect to c if c(v)=c(u) for all neighbors u of v. Further, an edge (u,v) is happy if c(u)=c(v). Given a ...
  • A parameterized perspective on attacking and defending elections 
    Gowda, Kishen N.; Misra, Neeldhara; Patel, Vraj (Cornell University Library, 2020-05)
    We consider the problem of protecting and manipulating elections by recounting and changing ballots, respectively. Our setting involves a plurality-based election held across multiple districts, and the problem formulations ...
  • A parameterized perspective on protecting elections 
    Dey, Palash; Misra, Neeldhara; Nath, Swaprava; Shakya, Garima (Cornell University Library, 2019-05)
    We study the parameterized complexity of the optimal defense and optimal attack problems in voting. In both the problems, the input is a set of voter groups (every voter group is a set of votes) and two integers $k_a$ and ...
  • PHINC: a parallel hinglish social media code-mixed corpus for machine translation 
    Srivastava, Vivek; Singh, Mayank (Cornell University Library, 2020-04)
  • PlantDoc: a dataset for visual plant disease detection 
    Singh, Davinder; Jain, Naman; Jain, Pranjali; Kayal, Pratik; Kumawat, Sudhakar; Batra, Nipun (Cornell University Library, 2019-11)
    India loses 35% of the annual crop yield due to plant diseases. Early detection of plant diseases remains difficult due to the lack of lab infrastructure and expertise. In this paper, we explore the possibility of computer ...
  • PoliWAM: an exploration of a large scale corpus of political discussions on WhatsApp messenger 
    Srivastava, Vivek; Singh, Mayank (Cornell University Library, 2020-10)
    WhatsApp Messenger is one of the most popular channels for spreading information with a current reach of more than 180 countries and 2 billion people. Its widespread usage has made it one of the most popular media for ...
  • Polynomial-time algorithm for Isomorphism of graphs with clique-width at most 3 
    Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod (Cornell University Library, 2015-06)
    The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures. The class of graphs with bounded clique-width contains bounded tree-width graphs. While there are many results on the ...

Search Digital Repository


Browse

My Account