2430 search results - page 172 / 486 » Computing Tutte Polynomials |
129
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
166
click to vote
ICCV
2011
IEEE
14 years 4 months ago
2011
IEEE
We present a new Coprime Blurred Pair (CBP) theory that may benefit a number of computer vision applications. A CBP is constructed by blurring the same latent image with two unkn...
124
click to vote
COMGEO
2010
ACM
15 years 4 months ago
2010
ACM
We use Bernstein's Theorem [1] to obtain combinatorial bounds for the number of embeddings of Laman graph frameworks modulo rigid motions. For this, we study the mixed volume...
144
click to vote
DLT
2009
15 years 2 months ago
2009
Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k 2, is NP-hard [Theoret...
204
click to vote
NETWORKS
2011
14 years 11 months ago
2011
We present an exact algorithm for computing an earliest arrival flow in a discrete time setting on series-parallel graphs. In contrast to previous results for the earliest arrival...