To any graph G can be associated a toric ideal I G. In this talk some recent joint work with Enrique Reyes and Christos Tatakis will be presented on the toric ideal of a graph. A characterization in graph theoretical terms of the elements of the Graver basis and the universal Gröbner basis of the toric ideal of a graph will be given. The Graver basis is the union of the primitive binomials of t...

In this article we propose a general and robust technique for modeling surfaces through the analysis of multiple image acquisitions. Our method is based on the minimization of the multi-view texture mismatch and is inherently multi-resolution, as the surface is obtained through a progressive re0nement of hierarchical radial basis functions. ? 2002 Elsevier Science B.V. All rights reserved.

H–bases are bases for polynomial ideals, characterized by the fact that their homogeneous leading terms are a basis for the associated homogeneous ideal. In the computation of H–bases without term orders, an important task is to determine the orthogonal projection of a homogeneous polynomial to certain subspaces of homogeneous polynomials with respect to a given inner product. One way of doing ...

In this paper, we identify univariate prewavelets on spaces spanned by translates of multiquadric functions and other radial basis functions with nonequally spaced centers (or "knots"). Although the multiquadric function and its relations are our prime examples, the theory is sufficiently broad to admit prewavelets from other radial basis function spaces as well.

Numerical solutions of the Helmholtz equation suffer from numerical pollution especially for the case of high wavenumbers. The major component of the numerical pollution is, as has been reported in the literature, the dispersion error which is defined as the phase difference between the numerical and the exact wave. The dispersion error for the meshless methods can be a priori determined at an ...

As is now well known for some basic functions φ, hierarchical and fast multipole-like methods can greatly reduce the storage and operation counts for fitting and evaluating radial basis functions. In particular, for spline functions of the form

The Beppo-Levi native spaces which arise when using polyharmonic splines to interpolate in many space dimensions are embedded in Hölder-Zygmund spaces. Convergence rates for radial basis function interpolation are inferred in some special cases.

We introduce a class of matrix-valued radial basis functions (RBFs) of compact support that can be customized, e.g. chosen to be divergence-free. We then derive and discuss error estimates for interpolants and derivatives based on these matrixvalued RBFs.

The behavior of Radial Basis Function (RBF) Networks greatly depends on how the center points of the basis functions are selected. In this work we investigate the use of instance reduction techniques, originally developed to reduce the storage requirements of instance based learners, for this purpose. Five Instance-Based Reduction Techniques were used to determine the set of center points, and ...