This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
Generalized Hermite polynomials in two variables are employed for the reconstruction of images from a knowledge of their zero crossing contours. The problem of reconstruction of s...
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations w...
We define a multivariate polynomial that generalizes in a unified way the twovariable interlace polynomial defined by Arratia, Bollob´as and Sorkin on the one hand, and a one-...
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...