The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
Abstract. A fundamental issue in evolutionary biology is the transition from unicellular to multicellular organisms, and the cellular differentiation that accompanies the increase...
Cristian A. Solari, John O. Kessler, Raymond E. Go...
In this paper, we present a role-based access control method for accessing databases through the Open Grid Services Architecture – Data Access and Integration (OGSA-DAI) framewor...
Anil L. Pereira, Vineela Muppavarapu, Soon M. Chun...
3D modelling finds a wide range of applications in industry. However, due to the presence of surface scanning noise, accumulative registration errors, and improper data fusion, re...