597 search results - page 88 / 120 » New Algorithms for Improved Transcendental Functions on IA-6... |
BMCBI
2008
13 years 8 months ago
2008
Background: In this paper, it is proposed an optimization approach for producing reduced alphabets for peptide classification, using a Genetic Algorithm. The classification task i...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
RECOMB
1999
Springer
14 years 22 days ago
1999
Springer
An important goal in bioinformatics is determining the homology and function of proteins from their sequences. Pairwise sequence similarity algorithms are often employed for this ...
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
Many computer vision problems can be formulated in
a Bayesian framework with Markov Random Field (MRF)
or Conditional Random Field (CRF) priors. Usually, the
model assumes that ...