A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
Abstract. We show that subsumption problems in EL and related description logics can be expressed as uniform word problems in classes of semilattices with monotone operators. We us...
This paper presents a direct method for finding corresponding pairs of parts between two shapes. Statistical knowledge about a large number of parts from many different objects is...
This paper studies dissipativity for a class of infinite-dimensional systems, called pseudorational, in the behavioral context. A basic equivalence condition for dissipativity is e...
Background: The amount of gene expression data in the public repositories, such as NCBI Gene Expression Omnibus (GEO) has grown exponentially, and provides a gold mine for bioinfo...
Rong Chen, Rohan Mallelwar, Ajit Thosar, Shivkumar...