• Prefetching in hybrid main memory systems 

  V., Subisha; Gohil, Varun; Ujjainkar, Nisarg; Awasthi, Manu (2020-07-13)
• On coresets for regularized regression 

  Chhaya, Rachit; Dasgupta, Anirban; Shit, Supratim (Cornell University Library, 2020-06)
• A parameterized perspective on attacking and defending elections 

  Gowda, Kishen N.; Misra, Neeldhara; Patel, Vraj (2020-06-08)
• Gandhipedia: a one-stop AI-enabled portal for browsing Gandhian literature, life-events and his social network 

  Adak, Sayantan; Vyas, Atharva; Mukherjee, Animesh; Ambavi, Heer; Kadasi, Pritam; Singh, Mayank; Patel, Shivam (Cornell University Library, 2020-06)

  We introduce an AI-enabled portal that presents an excellent visualization of Mahatma Gandhis life events by constructing temporal and spatial social networks from the Gandhian literature. Applying an ensemble of methods ...
• SEAL: scientific keyphrase extraction and classification 

  Garg, Ayush; Kagi, Sammed Shantinath; Singh, Mayank (Cornell University Library, 2020-06)
• Streaming coresets for symmetric tensor factorization 

  Chhaya, Rachit; Choudhari, Jayesh; Dasgupta, Anirban; Shit, Supratim (Cornell University Library, 2020-06)
• Subexponential algorithm for d-cluster edge deletion: exception or rule? 

  Misra, Neeldhara; Panolan, Fahad; Saurabh, Saket (Elsevier, 2020-11)
• An approximate marginal spread computation approach for the budgeted influence maximization with delay 

  Banerjee, Suman; Jenamani, Mamata; Pratihar, Dilip Kumar (Cornell University Library, 2020-05)
• Red-blue point separation for points on a circle 

  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 ...
• 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 ...
• 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 ...
• Imbalance parameterized by twin cover revisited 

  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 ...
• Exploring Bayesian optimization 

  Agnihotri, Apoorv; Batra, Nipun (Distill Working Group, 2020-05)
• Docker characterization on high performance SSDs 

  Awasthi, Manu et al. (2017-04-24)
• On the complexity of winner verification and candidate winner for multiwinner voting rules 

  Sonar, Chinmay; Dey, Palash; Misra, Neeldhara (Cornell University Library, 2020-04)
• Polynomial-time algorithm for isomorphism of graphs with clique-width at most three 

  Das, Bireswar; Enduri, Murali Krishna; Reddy, I. Vinod (Elsevier, 2020-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. We give a polynomial time graph isomorphism ...
• PHINC: a parallel hinglish social media code-mixed corpus for machine translation 

  Srivastava, Vivek; Singh, Mayank (Cornell University Library, 2020-04)
• Generation and evaluation of privacy preserving synthetic health data 

  Yale, Andrew; Dash, Saloni; Dutta, Ritik; Guyon, Isabelle; Pavao, Adrien; Bennett, Kristin P. (Elsevier, 2020-04)

  We develop metrics for measuring the quality of synthetic health data for both education and research. We use novel and existing metrics to capture a synthetic dataset�s resemblance, privacy, utility and footprint. Using ...
• Earned benefit maximization in social networks under budget constraint 

  Banerjee, Suman; Jenamani, Mamata; Pratihar, Dilip Kumar (Cornell University Library, 2020-04)

  Given a social network with nonuniform selection cost of the users, the problem of \textit{Budgeted Influence Maximization} (BIM in short) asks for selecting a subset of the nodes within an allocated budget for initial ...
• 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 ...

View more