Browsing E-print Articles by Title

Browsing E-print Articles by Title

Sort by: Order: Results:

  • Kayal, Pratik; Anand, Mrinal; Desai, Harsh; Singh, Mayank (Cornell University Library, 2021-05)
    Tables present important information concisely in many scientific documents. Visual features like mathematical symbols, equations, and spanning cells make structure and content extraction from tables embedded in research ...
  • Jalal, Jagriti; Singh, Mayank; Pal, Arindam; Dey, Lipika; Mukherjee, Animesh (Cornell University Library, 2020-07)
  • Patel, Harsh; Kulkarni, Amey; Sahni, Shivam; Vyas, Udit (Cornell University Library, 2021-08)
    Image Inpainting is one of the very popular tasks in the field of image processing with broad applications in computer vision. In various practical applications, images are often deteriorated by noise due to the presence ...
  • Misra, Neeldhara; Mittal, Harshil (Cornell University Library, 2020-05)
    We study the problem of Imbalance parameterized by the twin cover of a graph. We show that Imbalance is XP parameterized by twin cover, and FPT when parameterized by the twin cover and the size of the largest clique outside ...
  • Gowda, Kishen N.; Lonkar, Aditya; Panolan, Fahad; Patel, Vraj; Saurabh, Saket (Cornell University Library, 2020-09)
  • 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 ...
  • 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}. ...
  • 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 ...
  • Gupta, Manoj; Khan, Shahbaz (Cornell University Library, 2017-04)
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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)
  • 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 ...

Search Digital Repository


Browse

My Account