Valentina Damerow, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler  Home/Search
Context
Related
| jhu.edu/~scheideler/pape...motion.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: jhu.edu/~scheideler/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We propose a new complexity measure for moving objects, the smoothed motion complexity. Many applications, e.g., GPS, are based on algorithms dealing with moving objects, but usually data about moving objects are inherently noisy due to measurement errors. Smoothed motion complexity considers this imprecise information and uses smoothed analysis [13] to model noisy data. The inputs are object to slight random perturbations and the smoothed complexity is the worst case expected complexity... (Update)
Similar documents based on text: More All
1.6: Smoothed Motion Complexity - Damerow, der Heide, Räcke.. (Correct)
0.6: Data Management in Networks: Experimental.. - Krick, der Heide, .. (1999) (Correct)
0.6: Universal Algorithms for Store-and-Forward and.. - Cypher, der Heide.. (1996) (Correct)
BibTeX entry: (Update)
@misc{ damerow-smoothed,
author = "Valentina Damerow and Friedhelm Meyer auf der Heide and Harald Räcke and
Christian Scheideler and Christian Sohler",
title = "Smoothed Motion Complexity",
url = "citeseer.ist.psu.edu/700173.html" }
Citations (may not include all citations):121 Data structures for mobile data - BASCH, GUIBAS et al. - 1999
26 Proximity problems on moving points - BASCH, GUIBAS et al. - 1997
21 Smoothed analysis of algorithms: Why the simplex algorithm u.. (context) - SPIELMAN, TENG - 2001
19 Kinetic collision detection for simple polygons (context) - KIRKPATRICK, SNOEYINK et al. - 2002
13 Uber die konvexe Hulle von n zufallig gewahlten Punkten (context) - ENYI, SULANKE - 1963
9 Maintaining approximate extent measures of moving points - AGARWAL, HAR-PELED - 2001
8 Efficiently approximating the minimum-volume bounding box of.. - BAREQUET, HAR-PELED - 1999
8 Clustering motion - HAR-PELED - 2001
3 Kinetic connectivity for unit disks - GUIBAS, HERSHBERGER et al. - 2001
3 Probabilistic analysis for combinatorial functions of moving.. - ZHANG, DEVARAJAN et al. - 1997
3 Simplified kinetic connectivity for rectangles and hypercube.. (context) - HERSHBERGER, SURI - 2001
3 Smoothed analysis of three combinatorial problems - BANDERIER, MEHLHORN et al. - 2002
2 Smoothed analysis of the perceptron algorithm (context) - BLUM, DUNAGAN - 2002
2 Smoothed analysis of property testing (context) - SPIELMAN, TENG - 2002
2 Smoothed analysis of the condition numbers and growth factor.. (context) - SANKAR, SPIELMAN - 2002
Documents on the same site (http://www.cs.jhu.edu/~scheideler/): More
Simple On-line Algorithms for the Maximum Disjoint Paths.. - Kolman, Scheideler (2001) (Correct)
Improved Bounds for the Unsplittable Flow Problem - Kolman, Scheideler (2002) (Correct)
Anycasting in Adversarial Systems: Routing and Admission .. - Awerbuch, Brinkmann.. (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC