1204 search results - page 131 / 241 » Termination of Polynomial Programs |
103
click to vote
IFIP
2004
Springer
15 years 6 months ago
2004
Springer
We introduce an extension of the Parikh mapping called the Parikh ¢ -matrix mapping, which takes its values in matrices with polynomial entries. The morphism constructed represent...
103
Voted
PODS
2010
ACM
15 years 5 months ago
2010
ACM
This paper approaches the incremental view maintenance problem from an algebraic perspective. We construct a ring of databases and use it as the foundation of the design of a quer...
126
click to vote
COCO
1991
Springer
15 years 4 months ago
1991
Springer
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
99
Voted
CC
2010
Springer
15 years 25 days ago
2010
Springer
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
113
Voted
ICASSP
2010
IEEE
14 years 11 months ago
2010
IEEE
A design method of a linear-phased, two-dimensional (2-D), twofold symmetric circular shaped filter is presented in this paper. Although the proposed method designs a non-separab...