activity
20172023
most citedTowards Exploiting Background Knowledge for Building Conversation Systems

11 citations · 25 across the 27 of their papers we have counts for

collaborators

32 papers

cs.DC2023

Cost and Reliability Aware Scheduling of Workflows Across Multiple Clouds with Security Constraints

Atherve Tekawade, Suman Banerjee

Many real-world scientific workflows can be represented by a Directed Acyclic Graph (DAG), where each node represents a task and a directed edge signifies a dependency between two…

cs.CY2022

A Makespan and Energy-Aware Scheduling Algorithm for Workflows under Reliability Constraint on a Multiprocessor Platform

Atharva Tekawade, Suman Banerjee

Many scientific workflows can be modeled as a Directed Acyclic Graph (henceforth mentioned as DAG) where the nodes represent individual tasks, and the directed edges represent data…

cs.DC2022★ 1 cited

A Cost Effective Reliability Aware Scheduler for Task Graphs in Multi-Cloud System

Atharva Tekawade, Suman Banerjee

Many scientific workflows can be represented by a Directed Acyclic Graph (DAG) where each node represents a task, and there will be a directed edge between two tasks if and only if…

cs.DC2022

CEDCES: A Cost Effective Deadline Constrained Evolutionary Scheduler for Task Graphs in Multi-Cloud System

Atharva Tekawade, Suman Banerjee

Many scientific workflows can be modeled as a Directed Acyclic Graph (henceforth mentioned as DAG) where the nodes represent individual tasks and the directed edges represent data…

cs.DB2022

Envy\mbox{-}free Trip Planning in Group Trip Planning Query Problem

Mayank Singhal, Suman Banerjee

In recent times, Group Trip Planning Query (henceforth referred to as GTP Query) is one of the well\mbox{-}studied problems in Spatial Databases. The inputs to the problem are a ro…

cs.DB2022

Utility Driven Job Selection Problem on Road Networks

Mayank Singhal, Suman Banerjee

In this paper, we study the problem of \textsc{Utility Driven Job Selection} on Road Networks for which the inputs are: a road network with the vertices as the set of Point-Of-Inte…

cs.DB2022

Profit Maximization using Social Networks in Two-Phase Setting

Poonam Sharma, Suman Banerjee

Now-a-days, \emph{Online Social Networks} have been predominantly used by commercial houses for viral marketing where the goal is to maximize profit. In this paper, we study the pr…

cs.DB2022

Influential Billboard Slot Selection using Pruned Submodularity Graph

Dildar Ali, Suman Banerjee, Yamuna Prasad

Billboard Advertisement has emerged as an effective out-of-home advertisement technique and adopted by many commercial houses. In this case, the billboards are owned by some compan…

cs.LG2022★ 4 cited

Hierarchical Federated Learning with Privacy

Varun Chandrasekaran, Suman Banerjee, Diego Perino +1

Federated learning (FL), where data remains at the federated clients, and where only gradient updates are shared with a central aggregator, was assumed to be private. Recent work d…

cs.NI2022

Network-Side Digital Contact Tracing on a Large University Campus

Matthew L. Malloy, Lance Hartung, Steve Wangen +1

We describe a study conducted at a large public university campus in the United States which shows the efficacy of network log information for digital contact tracing and predictio…

cs.DS2021

Structural Parameterizations of Budgeted Graph Coloring

Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik +1

We introduce a variant of the graph coloring problem, which we denote as {\sc Budgeted Coloring Problem} (\bcp). Given a graph , an integer and an ordered list of integers $…

cs.LG2021★ 1 cited

Few-Shot Domain Adaptation For End-to-End Communication

Jayaram Raghuram, Yijing Zeng, Dolores García Martí +4

The problem of end-to-end learning of a communication system using an autoencoder -- consisting of an encoder, channel, and decoder modeled using neural networks -- has recently be…

cs.DB2021

A Survey on Mining and Analysis of Uncertain Graphs

Suman Banerjee

\emph{Uncertain Graph} (also known as \emph{Probabilistic Graph}) is a generic model to represent many real\mbox{-}world networks from social to biological. In recent times analysi…

cs.MA2021

A Social Distancing-Based Facility Location Approach for Combating COVID-19

Suman Banerjee, Bithika Pal, Maheswar Singhamahapatra

In this paper, we introduce and study the problem of facility location along with the notion of \emph{`social distancing'}. The input to the problem is the road network of a city w…

cs.CR2021

Moonshine: An Online Randomness Distiller for Zero-Involvement Authentication

Jack West, Kyuin Lee, Suman Banerjee +3

Context-based authentication is a method for transparently validating another device's legitimacy to join a network based on location. Devices can pair with one another by continuo…

cs.DB2021

Budgeted Influence and Earned Benefit Maximization with Tags in Social Networks

Suman Banerjee, Bithika Pal

Given a social network, where each user is associated with a selection cost, the problem of \textsc{Budgeted Influence Maximization} (\emph{BIM Problem} in short) asks to choose a…

cs.SI2021

A Co\mbox{-}Operative Game Theoretic Approach for the Budgeted Influence Maximization Problem

Suman Banerjee

Given a social network of users with selection cost, the \textsc{Budgeted Influence Maximization Problem} (\emph{BIM Problem} in short) asks for selecting a subset of the nodes (kn…

cs.DS2020

An Efficient Updation Approach for Enumerating Maximal \mbox{-}Cliques of a Temporal Network

Suman Banerjee, Bithika Pal

Given a temporal network , (where and $[t_a,t_b] \sub…

cs.LG2020★ 6 cited

A General Framework For Detecting Anomalous Inputs to DNN Classifiers

Jayaram Raghuram, Varun Chandrasekaran, Somesh Jha +1

Detecting anomalous inputs, such as adversarial and out-of-distribution (OOD) inputs, is critical for classifiers (including deep neural networks or DNNs) deployed in real-world ap…

cs.SI2020

An Approximate Marginal Spread Computation Approach for the Budgeted Influence Maximization with Delay

Suman Banerjee, Mamata Jenamani, Dilip Kumar Pratihar

In this paper, we study the Budgeted Influence Maximization with Delay Problem, for which the number of literature are limited. We propose an approximate marginal spread computatio…

cs.DS2020

First Stretch then Shrink and Bulk: A Two Phase Approach for Enumeration of Maximal \mbox{-}Cliques of a Temporal Network

Suman Banerjee, Bithika Pal

A \emph{Temporal Network} (also known as \emph{Link Stream} or \emph{Time-Varying Graph}) is often used to model a time-varying relationship among a group of agents. It is typicall…

cs.SI2020

Earned Benefit Maximization in Social Networks Under Budget Constraint

Suman Banerjee, Mamata Jenamani, Dilip Kumar Pratihar

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…

cs.DB2020

DySky: Dynamic Skyline Queries on Uncertain Graphs

Suman Banerjee, Bithika Pal

Given a graph, and a set of query vertices (subset of the vertices), the dynamic skyline query problem returns a subset of data vertices (other than query vertices) which are not d…

cs.SI2020

Designing and Connectivity Checking of Implicit Social Networks from the User-Item Rating Data

Suman Banerjee

\emph{Implicit Social Network} is a connected social structure among a group of persons, where two of them are linked if they have some common interest. One real\mbox{-}life exampl…