2766 search results - page 299 / 554 » Algorithms for trigonometric polynomials |
157
click to vote
PODS
2007
ACM
16 years 5 months ago
2007
ACM
We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and whyprovenance are particular cases of the same general algorithms...
127
Voted
STACS
2010
Springer
15 years 12 months ago
2010
Springer
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...
173
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
138
click to vote
CAI
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
151
click to vote
ISSAC
2007
Springer
15 years 11 months ago
2007
Springer
We study arithmetic operations for triangular families of polynomials, concentrating on multiplication in dimension zero. By a suitable extension of fast univariate Euclidean divi...