A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
We present a Semantic Web application that we call CS AKTive Space1 . The application exploits a wide range of semantically heterogeneous and distributed content relating to Compu...
Monica M. C. Schraefel, Nigel R. Shadbolt, Nichola...
We present a novel classification-based algorithm called GeneClass for learning to predict gene regulatory response. Our approach is motivated by the hypothesis that in simple orga...
Manuel Middendorf, Anshul Kundaje, Chris Wiggins, ...
Association analysis arises in many important applications such as bioinformatics and business intelligence. Given a large collection of measurements over a set of samples, associ...
Feng Pan, Lynda Yang, Leonard McMillan, Fernando P...
Reverse-engineering of gene networks using linear models often results in an underdetermined system because of excessive unknown parameters. In addition, the practical utility of ...