36 search results - page 1 / 8 » Streaming algorithms for line simplification |
COMPGEOM
2007
ACM
15 years 1 months ago
2007
ACM
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...
172
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper describes how to fit fractal models, online, on IP traffic data streams. Our approach relies on maintaining a sketch of the data stream and fitting straight lines: it y...
CGVR
2006
14 years 11 months ago
2006
In this paper we introduce an algorithm for simplifying a 2D discrete region. This algorithm is based on a bipolar model of regions. Given a discrete region, we cut its Voronoi di...
GIS
2009
ACM
15 years 4 months ago
2009
ACM
The increasing availabilities of GPS-enabled devices have given rise to the location-based social networking services (LBSN), in which users can record their travel experiences wi...
SIGSOFT
2010
ACM
14 years 7 months ago
2010
ACM
Concurrent programs are notoriously difficult to debug. We see two main reasons for this: 1) concurrency bugs are often difficult to reproduce, 2) traces of buggy concurrent execu...