1383 search results - page 53 / 277 » On the Complexity of the Interlace Polynomial |
158
click to vote
ECML
2004
Springer
15 years 11 months ago
2004
Springer
Regression methods aim at inducing models of numeric data. While most state-of-the-art machine learning methods for regression focus on inducing piecewise regression models (regres...
119
click to vote
DM
2007
15 years 6 months ago
2007
We show that each polynomial a(z)=1+a1z+· · ·+adzd in N[z] having only real zeros is the f-polynomial of a multicomplex. It follows that a(z) is also the h-polynomial of a Cohe...
150
click to vote
CORR
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
158
click to vote
CASC
2010
Springer
15 years 5 months ago
2010
Springer
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
145
click to vote
ICIP
2005
IEEE
16 years 7 months ago
2005
IEEE
In this paper, we propose new sampling schemes for classes of 2-D signals with finite rate of innovation (FRI). In particular, we consider sets of 2-D Diracs and bilevel polygons....