A sensor-based framework for kinetic data compression
From MaRDI portal
Publication:482331
DOI10.1016/j.comgeo.2014.09.002zbMath1305.94017OpenAlexW2149508918MaRDI QIDQ482331
Sorelle A. Friedler, David M. Mount
Publication date: 23 December 2014
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2014.09.002
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Efficient sensor network design for continuous monitoring of moving objects
- Some dynamic computational geometry problems
- Fast algorithms for collision and proximity problems involving moving geometric objects
- Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model
- Algorithms for distributed functional monitoring
- Multidimensional online tracking
- Spatio-temporal Range Searching over Compressed Kinetic Sensor Data
- Generalized Kraft Inequality and Arithmetic Coding
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Data Structures for Mobile Data
- Compression of Low Entropy Strings with Lempel--Ziv Algorithms
- A computational framework for incremental motion
- Elements of Information Theory
- A Method for the Construction of Minimum-Redundancy Codes
This page was built for publication: A sensor-based framework for kinetic data compression
