1379 search results - page 61 / 276 » The Complexity of the Annihilating Polynomial |
168
click to vote
UAI
2008
15 years 7 months ago
2008
It is well-known that inference in graphical models is hard in the worst case, but tractable for models with bounded treewidth. We ask whether treewidth is the only structural cri...
126
click to vote
DAM
2006
15 years 6 months ago
2006
In the paper, the computational complexity of several variants of the problem of isothermic DNA sequencing by hybridization, is analyzed. The isothermic sequencing is a recent met...
182
click to vote
COLOGNETWENTE
2010
15 years 4 months ago
2010
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
160
click to vote
ISAAC
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
128
click to vote
CEC
2009
IEEE
16 years 28 days ago
2009
IEEE
—Univariate Marginal Distribution Algorithms (UMDAs) are a kind of Estimation of Distribution Algorithms (EDAs) which do not consider the dependencies among the variables. In thi...