Sciweavers

388 search results - page 76 / 78
» Learning Methods for DNA Binding in Computational Biology
Sort
View
COLT
2008
Springer
13 years 9 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
BMCBI
2010
113views more  BMCBI 2010»
13 years 7 months ago
Gene prioritization and clustering by multi-view text mining
Background: Text mining has become a useful tool for biologists trying to understand the genetics of diseases. In particular, it can help identify the most interesting candidate g...
Shi Yu, Léon-Charles Tranchevent, Bart De M...
BIBE
2007
IEEE
167views Bioinformatics» more  BIBE 2007»
13 years 11 months ago
Assessing the Performance of Macromolecular Sequence Classifiers
Machine learning approaches offer some of the most cost-effective approaches to building predictive models (e.g., classifiers) in a broad range of applications in computational bio...
Cornelia Caragea, Jivko Sinapov, Vasant Honavar, D...
GECCO
2010
Springer
191views Optimization» more  GECCO 2010»
14 years 6 days ago
Initialization parameter sweep in ATHENA: optimizing neural networks for detecting gene-gene interactions in the presence of sma
Recent advances in genotyping technology have led to the generation of an enormous quantity of genetic data. Traditional methods of statistical analysis have proved insufficient i...
Emily Rose Holzinger, Carrie C. Buchanan, Scott M....
ICCV
1995
IEEE
13 years 11 months ago
Fast Object Recognition in Noisy Images Using Simulated Annealing
A fast simulatedannealingalgorithmis developed for automatic object recognition. The object recognition problem is addressed as the problem of best describing a match between a hy...
Margrit Betke, Nicholas C. Makris