2 search results - page 1 / 1 » Efficient computation of the binary vector that maximizes a ... |
ICASSP
2008
IEEE
13 years 11 months ago
2008
IEEE
The maximization of a full-rank quadratic form over a finite alphabet is NP-hard in both a worst-case sense and an average sense. Interestingly, if the rank of the form is not a ...
BICOB
2010
Springer
13 years 2 months ago
2010
Springer
Fold recognition is a key problem in computational biology that involves classifying protein sharing structural similarities into classes commonly known as "folds". Rece...