Online Metric Tracking and Smoothing

We consider the online smoothing problem , in which a tracker is required to maintain distance no more than Δ≥0 from a time-varying signal f while minimizing its own movement. The problem is determined by a metric space ( X , d ) with an associated cost function c :ℝ→ℝ. Given a signal f 1 , f 2 ,…∈...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 68; no. 1; pp. 133 - 151
Main Authors:	Chen, Sixia, Russell, Alexander
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.01.2014 Springer
Subjects:	Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer Science Computer science; control theory; systems Computer Systems Organization and Communication Networks Data Structures and Information Theory Exact sciences and technology Mathematics of Computing Theoretical computing Theory of Computation Online algorithms Randomized algorithms On line Tracking Proximity Metric space Fixed cost Competitiveness Algorithmics Online algorithm Randomized algorithm Time varying system Smoothing Metric Deterministic algorithms
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!