Approximating center points with iterated radon points
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
Wireless integrated network sensors
Communications of the ACM
An on-line algorithm for fitting straight lines between data ranges
Communications of the ACM
Adaptive precision setting for cached approximate values
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Lectures on Discrete Geometry
Location Privacy in Pervasive Computing
IEEE Pervasive Computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Location Based Services
Solving convex programs by random walks
Journal of the ACM (JACM)
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Holistic aggregates in a networked world: distributed tracking of approximate quantiles
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Sketching streams through the net: distributed approximate query tracking
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Communication-efficient distributed monitoring of thresholded counts
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Approximating the centroid is hard
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Model-driven data acquisition in sensor networks
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Towards an internet-scale XML dissemination service
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Value-based notification conditions in large-scale publish/subscribe systems?
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Algorithms for distributed functional monitoring
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Combinatorial Optimization: Theory and Algorithms
Combinatorial Optimization: Theory and Algorithms
Online algorithms to minimize resource reallocations and network communication
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Functional Monitoring without Monotonicity
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Maintaining Nets and Net Trees under Incremental Motion
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Competitive analysis for service migration in VNets
Proceedings of the second ACM SIGCOMM workshop on Virtualized infrastructure systems and architectures
Algorithms for distributed functional monitoring
ACM Transactions on Algorithms (TALG)
Online tracking of the dominance relationship of distributed multi-dimensional data
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Kinetic convex hulls and delaunay triangulations in the black-box model
Proceedings of the twenty-seventh annual symposium on Computational geometry
Continuous distributed monitoring: a short survey
Proceedings of the First International Workshop on Algorithms and Models for Distributed Event Processing
Tracking moving objects with few handovers
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Online function tracking with generalized penalties
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Optimizing notifications of subscription-based forecast queries
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Competitive query strategies for minimising the ply of the potential locations of moving points
Proceedings of the twenty-ninth annual symposium on Computational geometry
The Wide-Area Virtual Service Migration Problem: A Competitive Analysis Approach
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We propose and study a new class of online problems, which we call online tracking. Suppose an observer, say Alice, observes a multi-valued function f: Z+ → Zd overtime in an online fashion, i.e., she only sees f(t) for t ≤ tnow where tnow is the current time. She would like to keep a tracker, say Bob, informed of the current value of f at all times. Under this setting, Alice could send new values of f to Bob from time to time, so that the current value of f is always within a distance of Δ to the last value received by Bob. We give competitive online algorithms whose communication costs are compared with the optimal offline algorithm that knows the entire f in advance. We also consider variations of the problem where Alice is allowed to send "predictions" to Bob, to further reduce communication for well-behaved functions. These online tracking problems have a variety of application ranging from sensor monitoring, location-based services, to publish/subscribe systems.