Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
Jonathan W. Berry, Bruce Hendrickson, Simon Kahan,...
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
Background: The majority of peptide bonds in proteins are found to occur in the trans conformation. However, for proline residues, a considerable fraction of Prolyl peptide bonds ...
Jiangning Song, Kevin Burrage, Zheng Yuan, Thomas ...
Abstract--This paper proposes an analytical model to estimate the cost of running an affinity-based thread schedule on multicore systems. The model consists of three submodels to e...
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
A. P. Yogananda, M. Narasimha Murty, Lakshmi Gopal