• IIT Gandhinagar at SemEval-2019 Task 3: contextual emotion detection using deep learning 

  Pamnani, Arik; Goel, Rajat; Choudhari, Jayesh; Singh, Mayank (2019-06)
• 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 ...
• Evaluation of cascading infrastructure failures and optimal recovery from a network science perspective 

  Warner, Mary; Sharma, Bharat; Bhatia, Udit; Ganguly, Auroop (2017-06)
• Emotive stimuli-triggered participant-based clustering using a novel split-and-merge algorithm 

  Nath, Surabhi S.; Mukhopadhyay, Dyutiman; Miyapuram, Krishna P. (03-01-2019)
• Random projections in gravitational wave searches of compact binaries 

  Reza, Amit; Sengupta, Anand; Dasgupta, Anirban (15-01-2019)
• Balancing open science and data privacy in the water sciences 

  Bhatia, Udit (Wiley, 2019-05)

  Open science practices such as publishing data and code are transforming water science by enabling synthesis and enhancing reproducibility. However, as research increasingly bridges the physical and social science domains ...
• Local phase U-Net for fundus image segmentation 

  Kumawat, Sudhakar and Raman, Shanmuganathan (12-05-2019)
• Better analysis of binary search tree on decomposable sequences 

  Goyal, Navin; Gupta, Manoj, (Elsevier, 2019-01)

  In their seminal paper Sleator and Tarjan (1985) [15], the authors conjectured that the splay tree is a dynamically optimal binary search tree (BST). In spite of decades of intensive research, the problem remains open. ...
• Robustness radius for chamberlin-courant on restricted domains 

  Misra, Neeldhara; Sonar, Chinmay (27-01-2019)
• On the complexity of optimal matching reconfiguration 

  Gupta, Manoj; Kumar, Hitesh; Misra, Neeldhara (27-01-2019)
• Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers 

  Dey, Palash; Misra, Neeldhara; Narahari, Y. (Elsevier, 2019-04)

  Approval voting provides an opportunity for the agents to make a comment about every candidate, without incurring the overhead of determining a full ranking on the entire set of candidates. This makes approval voting a ...
• Reflection symmetry aware image retargeting 

  Patel, Diptiben; Nagar, Rajendra; Raman, Shanmuganathan (Elsevier, 2019-04)

  Reflection symmetry is one of the most commonly occurring and prominent visual attributes present in the real world. With an increase in the display devices of different sizes and aspect ratios, the images captured from ...
• FAB: framework for analyzing benchmarks 

  Gohil, Varun; Singh, Shreyas; Awasthi, Manu (Association for Computing Machinery, 2019-04)
• Feedback influences discriminability and attractiveness components of probability weighting in descriptive choice under risk 

  Goyal, Shruti; Miyapuram, Krishna Prasad (Frontiers Media, 2019-04)

  Our understanding of the decisions made under scenarios where both descriptive and experience-based information are available is very limited. Underweighting of small probabilities was observed in the gain domain when both ...
• Improved linear embeddings via Lagrange duality 

  Sheth, Kshiteej; Garg, Dinesh; Dasgupta, Anirban (Springer, 2019-03)

  Near isometric orthogonal embeddings to lower dimensions are a fundamental tool in data science and machine learning. In this paper, we present the construction of such embeddings that minimizes the maximum distortion for ...
• BioGen: automated biography generation 

  Ambavi, Heer; Garg, Ayush; Nitiksha; Sharma, Mridul; Sharma, Rohit; Choudhari, Jayesh; Singh, Mayank (2019-01-02)
• On structural parameterizations of firefighting 

  Das, Bireswar; Enduri, Murali Krishna; Kiyomi, Masashi; Misra, Neeldhara; Otachi, Yota; Reddy, I. Vinod; Yoshimura, Shunya (Elsevier, 2019-03)

  he Firefighting problem is defined as follows. At time , a fire breaks out at a vertex of a graph. At each time step, a firefighter permanently defends (protects) an unburned vertex, and the fire then spreads to all ...
• Fast and accurate intrinsic symmetry detection 

  Nagar, Rajendra; Raman, Shanmuganathan (2018-12-22)
• Unsupervised GIST based clustering for object localization 

  Shah, Saprem; Khatri, Kunal| Mhasakar, Purva; Nagar, Rajendra; Raman, Shanmuganathan (2019-02-20)
• Automated early leaderboard generation from comparative tables 

  Singh, Mayank; Sarkar, Rajdeep; Vyas, Atharva; Goyal, Pawan; Mukherjee, Animesh; Chakrabarti, Soumen (2019-04-17)

View more