Browsing E-print Articles by Title

Browsing E-print Articles by Title

Sort by: Order: Results:

  • 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 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 ...
  • 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 ...
  • 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 ...
  • Preference elicitation for single crossing domain 
    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 ...
  • The rise and rise of interdisciplinary research: Understanding the interaction dynamics of three major fields -- Physics, Mathematics & Computer Science 
    Hazra, Rima; Singh, Mayank; Goyal, Pawan; Adhikari, Bibhas; Mukherjee, Animesh (Cornell University Library, 2019-08)
    The distinction between sciences is becoming increasingly more artificial -- an approach from one area can be easily applied to the other. More exciting research nowadays is happening perhaps at the interfaces of disciplines ...
  • Saving critical nodes with firefighters is FPT 
    Choudhari, Jayesh; Dasgupta, Anirban; Misra, Neeldhara; Ramanujan, M. S. (Cornell University Library, 2017-05)
  • Simple dynamic algorithms for Maximal Independent Set and other problems 
    Gupta, Manoj; Khan, Shahbaz (Cornell University Library, 2018-04)
  • Space efficient representations of finite groups 
    Das, Bireswar; Sharma, Shivdutt; Vaidyanathan, P. R. (Cornell University Library, 2020-02)
  • A sparse nonlinear classifier design using AUC optimization 
    Garg, Dinesh; Kakkar, Vishal; Shevade, Shirish Krishnaj; Sundararajan, S. (Cornell University Library, 2016-12)
    AUC (Area under the ROC curve) is an important performance measure for applications where the data is highly imbalanced. Learning to maximize AUC performance is thus an important research problem. Using a max-margin based ...
  • Synthetic Event Time Series Health Data Generation 
    Dash, Saloni; Dutta, Ritik; Guyon, Isabelle; Pavao, Adrien; Yale, Andrew; Bennett, Kristin P. (Cornell University Library, 2019-11)
    Synthetic medical data which preserves privacy while maintaining utility can be used as an alternative to real medical data, which has privacy costs and resource constraints associated with it. At present, most models focus ...
  • Weakly-Supervised Deep Learning for Domain Invariant Sentiment Classification 
    Kayal, Pratik; Singh, Mayank; Goyal, Pawan (Cornell University Library, 2019-10)
    The task of learning a sentiment classification model that adapts well to any target domain, different from the source domain, is a challenging problem. Majority of the existing approaches focus on learning a common ...
  • Wheeled robots playing chain catch: strategies and evaluation 
    Agrawal, Garima; Karlapalem, Kamalakar (Cornell University Library, 2016-02)
    Robots playing games that humans are adept in is a challenge. We studied robotic agents playing Chain Catch game as a Multi-Agent System (MAS). Our game starts with a traditional Catch game similar to Pursuit evasion, and ...

Search Digital Repository


Browse

My Account