125 search results - page 12 / 25 » The Complexity of Rooted Phylogeny problems |
127
click to vote
JCSS
2008
15 years 1 months ago
2008
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
135
click to vote
COCO
2008
Springer
15 years 3 months ago
2008
Springer
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
127
Voted
SDM
2009
SIAM
15 years 11 months ago
2009
SIAM
Automotive companies are forced to continuously extend and improve their product line-up. However, increasing diversity, higher design complexity, and shorter development cycles c...
154
Voted
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
We present a new method for classification with structured
latent variables. Our model is formulated using the
max-margin formalism in the discriminative learning literature.
We...
122
Voted
ICCS
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...