K. Subramani

Learn More
In this paper, we describe an approach for solving the general class of energyoptimal task graph scheduling problems using priced timed automata. We provide an efficient zone-based algorithm for minimum-cost reachability. Furthermore, we show how the simple structure of the linear programs encountered during symbolic minimum-cost reachability analysis of(More)
We consider the satisfiability problem for Boolean combinations of unit two variable per inequality (UTVPI) constraints. A UTVPI constraint is linear constraint containing at most two variables with non-zero coefficients, where furthermore those coefficients must be either −1 or 1. We prove that if a satisfying solution exists, then there is a solution with(More)
Recent clinical and experimental evidences strongly acclaim Yes-associated protein (Yap), a key oncogenic driver in liver carcinogenesis, as a therapeutic target. Of the known multiple schemes to inhibit Yap activity, activation of Mammalian Sterile 20-like Kinase 1 (Mst1), an upstream regulator of Yap, appears to be a promising one. In this study, we(More)
This paper deals with community detection in social networks using density-based clustering. We compare two well-known concepts for community detection that are implemented as distance functions in the algorithms SCAN [1] and DEN-GRAPH [2], the structural similarity of nodes and the number of interactions between nodes, respectively, in order to evaluate(More)
In this paper, we propose an efficient method for implementing Dijkstra’s algorithm for the Single Source Shortest Path Problem (SSSPP) in a graph with positively lengthed edges, and where there are few distinct lengths. The SSSPP is one of the most widely studied problems in theoretical computer science and operations research. On a graph with n vertices,(More)