Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
Recent results on the local and global properties of multisymplectic discretizations of Hamiltonian PDEs are discussed. We consider multisymplectic (MS) schemes based on Fourier s...
Using a B-spline representation for splines with knots seen as free variables, the approximation to data by splines improves greatly. The main limitations are the presence of too ...
In this contribution, new online EM algorithms are proposed to perform inference in general hidden Markov models. These algorithms update the parameter at some deterministic times ...
Existing hierarchical summarization techniques fail to provide synopses good in terms of relative-error metrics. This paper introduces multiplicative synopses: a summarization par...