Browsing E-print Articles by Title

Browsing E-print Articles by Title

Sort by: Order: Results:

  • Chierichetti, Flavio; Dasgupta, Anirban; Kumar, Ravi (Cornell University Library, 2020-10)
  • 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 ...
  • Chhaya, Rachit; Dasgupta, Anirban; Shit, Supratim (Cornell University Library, 2020-06)
  • 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 ...
  • 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 ...
  • Sonar, Chinmay; Dey, Palash; Misra, Neeldhara (Cornell University Library, 2020-04)
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • Srivastava, Vivek; Singh, Mayank (Cornell University Library, 2020-04)
  • 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 ...
  • 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 ...
  • 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 ...
  • Dey, Palash; Misra, Neeldhara (Cornell University Library, 2016-04)
    Eliciting the preferences of a set of agents over a set of alternatives is a problem of fundamental importance in social choice theory. Prior work on this problem has studied the query complexity of preference elicitation ...
  • Srivastava, Vivek; Singh, Mayank (Cornell University Library, 2021-08)
    In this shared task, we seek the participating teams to investigate the factors influencing the quality of the code-mixed text generation systems. We synthetically generate code-mixed Hinglish sentences using two distinct ...
  • Anand, Mrinal; Garg, Aditya (Cornell University Library, 2021-11)
    We witnessed a massive growth in the supervised learning paradigm in the past decade. Supervised learning requires a large amount of labeled data to reach state-of-the-art performance. However, labeling the samples requires ...
  • Misra, Neeldhara; Mittal, Harshil; Sethia, Aditi (Cornell University Library, 2020-05)
    Given a set R of red points and a set B of blue points in the plane, the Red-Blue point separation problem asks if there are at most k lines that separate R from B, that is, each cell induced by the lines of the solution ...

Search Digital Repository


Browse

My Account