Sciweavers

1193 search results - page 238 / 239
» On the Complexity of Approximating Colored-Graph Problems
Sort
View
BMCBI
2010
178views more  BMCBI 2010»
13 years 6 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
BMCBI
2008
242views more  BMCBI 2008»
13 years 6 months ago
New time-scale criteria for model simplification of bio-reaction systems
Background: Quasi-steady state approximation (QSSA) based on time-scale analysis is known to be an effective method for simplifying metabolic reaction system, but the conventional...
Junwon Choi, Kyung-won Yang, Tai-yong Lee, Sang Yu...
ENGL
2007
148views more  ENGL 2007»
13 years 6 months ago
A General Reflex Fuzzy Min-Max Neural Network
—“A General Reflex Fuzzy Min-Max Neural Network” (GRFMN) is presented. GRFMN is capable to extract the underlying structure of the data by means of supervised, unsupervised a...
Abhijeet V. Nandedkar, Prabir Kumar Biswas
BMCBI
2005
115views more  BMCBI 2005»
13 years 6 months ago
Statistical distributions of optimal global alignment scores of random protein sequences
Background: The inference of homology from statistically significant sequence similarity is a central issue in sequence alignments. So far the statistical distribution function un...
Hongxia Pang, Jiaowei Tang, Su-Shing Chen, Shiheng...
PAMI
2002
122views more  PAMI 2002»
13 years 5 months ago
Analytic PCA Construction for Theoretical Analysis of Lighting Variability in Images of a Lambertian Object
We analyze theoretically the subspace best approximating images of a convex Lambertian object taken from the same viewpoint, but under different distant illumination conditions. Si...
Ravi Ramamoorthi