Browsing E-print Articles by Title

Browsing E-print Articles by Title

Sort by: Order: Results:

  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • Choudhari, Jayesh; Dasgupta, Anirban; Misra, Neeldhara; Ramanujan, M. S. (Cornell University Library, 2017-05)
  • Gupta, Manoj; Khan, Shahbaz (Cornell University Library, 2018-04)
  • 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 ...
  • 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 ...
  • 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