2430 search results - page 130 / 486 » Computing Tutte Polynomials |
144
Voted
CORR
2012
Springer
14 years 19 days ago
2012
Springer
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...
144
click to vote
ICCV
2009
IEEE
16 years 10 months ago
2009
IEEE
This paper proposes a new affine registration algorithm
for matching two point sets in IR2 or IR3. The input point
sets are represented as probability density functions, using
e...
143
Voted
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
Given an n-element set U and a family of subsets S ⊆ 2U we show how to count the number of k-partitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2nnO(1). The only...
102
click to vote
STACS
1997
Springer
15 years 9 months ago
1997
Springer
In this paper we present a new notion of what it means for a problem in P to be inherently sequential. Informally, a problem L is strictly sequential P-complete if when the best kn...
179
Voted
ARITH
1993
IEEE
15 years 9 months ago
1993
IEEE
This paper describes a logarithmic number system (LNS) arithmetic unit using a new methodfor polynomial interpolation in hardware. The use of an interleaved memory reduces storage...