1998 search results - page 162 / 400 » Complexity of the Cover Polynomial |
207
click to vote
CVPR
2006
IEEE
15 years 10 months ago
2006
IEEE
A wide range of computer vision applications such as distance field computation, shape from shading, and shape representation require an accurate solution of a particular Hamilton...
167
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
156
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
An Artin-Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp − X − α. Following Cantor and Couveignes, we give a...
152
click to vote
UC
2005
Springer
15 years 12 months ago
2005
Springer
We present a theoretical model for self-assembling tiles with flexible branches motivated by DNA branched junction molecules. We encode an instance of a “problem” as a pot of ...
144
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
We present a game-based semantic framework in which the time complexity of any IMELL proof can be read out of its interpretation. This gives a compositional view of the geometry of...