Sciweavers

2292 search results - page 163 / 459
» Hierarchical approximation and localization
Sort
View
ALGORITHMICA
2006
161views more  ALGORITHMICA 2006»
15 years 6 months ago
The Expected Size of the Rule k Dominating Set
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...
Jennie C. Hansen, Eric Schmutz, Li Sheng
FGCS
2006
142views more  FGCS 2006»
15 years 6 months ago
Conservation properties of multisymplectic integrators
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...
Alvaro L. Islas, Constance M. Schober
CSDA
2004
119views more  CSDA 2004»
15 years 6 months ago
Bounded optimal knots for regression splines
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 ...
Nicolas Molinari, Jean-François Durand, Rob...
ICA
2012
Springer
14 years 2 months ago
New Online EM Algorithms for General Hidden Markov Models. Application to the SLAM Problem
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 ...
Sylvain Le Corff, Gersende Fort, Eric Moulines
EDBT
2009
ACM
133views Database» more  EDBT 2009»
16 years 1 months ago
Multiplicative synopses for relative-error metrics
Existing hierarchical summarization techniques fail to provide synopses good in terms of relative-error metrics. This paper introduces multiplicative synopses: a summarization par...
Panagiotis Karras