Sciweavers

477 search results - page 15 / 96
» Algorithms for dynamic geometric problems over data streams
Sort
View
CGF
2010
149views more  CGF 2010»
13 years 7 months ago
Over Two Decades of Integration-Based, Geometric Flow Visualization
With ever increasing computing power, it is possible to process ever more complex fluid simulations. However, a gap between data set sizes and our ability to visualize them remain...
Tony McLoughlin, Robert S. Laramee, Ronald Peikert...
FOCS
1992
IEEE
13 years 11 months ago
Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
Pankaj K. Agarwal, David Eppstein, Jirí Mat...
RTSS
2006
IEEE
14 years 1 months ago
Prediction-Based QoS Management for Real-Time Data Streams
With the emergence of large wired and wireless sensor networks, many real-time applications need to operate on continuous unbounded data streams. At the same time, many of these s...
Yuan Wei, Vibha Prasad, Sang Hyuk Son, John A. Sta...
PODC
2006
ACM
14 years 1 months ago
Sketching asynchronous streams over a sliding window
We study the problem of maintaining sketches of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in w...
Srikanta Tirthapura, Bojian Xu, Costas Busch
STOC
2003
ACM
141views Algorithms» more  STOC 2003»
14 years 7 months ago
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Moses Charikar, Liadan O'Callaghan, Rina Panigrahy