Sciweavers

191 search results - page 24 / 39
» The basic feasible functionals in computable analysis
Sort
View
BMCBI
2008
122views more  BMCBI 2008»
14 years 12 months ago
High-throughput bioinformatics with the Cyrille2 pipeline system
Background: Modern omics research involves the application of high-throughput technologies that generate vast volumes of data. These data need to be pre-processed, analyzed and in...
Mark W. E. J. Fiers, Ate van der Burgt, Erwin Date...
CISS
2008
IEEE
15 years 6 months ago
On sparse representations of linear operators and the approximation of matrix products
—Thus far, sparse representations have been exploited largely in the context of robustly estimating functions in a noisy environment from a few measurements. In this context, the...
Mohamed-Ali Belabbas, Patrick J. Wolfe
COMPSAC
2007
IEEE
15 years 6 months ago
An Automatic Connector Generation Method for Dynamic Architecture
In a component-based system components are basic computation units implementing specific business functions, and their interactions are explicitly represented by connectors. If th...
Yiming Yang, Xin Peng, Wenyun Zhao
BIB
2007
139views more  BIB 2007»
14 years 12 months ago
Petri net modelling of biological networks
Mathematical modelling is increasingly used to get insights into the functioning of complex biological networks. In this context, Petri nets (PNs) have recently emerged as a promi...
Claudine Chaouiya
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
15 years 5 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao