Sciweavers

393 search results - page 78 / 79
» Convex Programming Methods for Global Optimization
Sort
View
BMCBI
2008
211views more  BMCBI 2008»
13 years 7 months ago
CPSP-tools - Exact and complete algorithms for high-throughput 3D lattice protein studies
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
Martin Mann, Sebastian Will, Rolf Backofen
BMCBI
2006
87views more  BMCBI 2006»
13 years 7 months ago
MathDAMP: a package for differential analysis of metabolite profiles
Background: With the advent of metabolomics as a powerful tool for both functional and biomarker discovery, the identification of specific differences between complex metabolite p...
Richard Baran, Hayataro Kochi, Natsumi Saito, Mako...
CVPR
2004
IEEE
14 years 9 months ago
Learning a Restricted Bayesian Network for Object Detection
Many classes of images have the characteristics of sparse structuring of statistical dependency and the presence of conditional independencies among various groups of variables. S...
Henry Schneiderman
BIBE
2006
IEEE
135views Bioinformatics» more  BIBE 2006»
14 years 1 months ago
Evidence of Multiple Maximum Likelihood Points for a Phylogenetic Tree
An interesting and important, but largely ignored question associated with the ML method is whether there exists only a single maximum likelihood point for a given phylogenetic tr...
Bing Bing Zhou, Monther Tarawneh, Pinghao Wang, Da...
MEMOCODE
2006
IEEE
14 years 1 months ago
Latency-insensitive design and central repetitive scheduling
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
Julien Boucaron, Robert de Simone, Jean-Vivien Mil...