477 search results - page 27 / 96 » Algorithms for dynamic geometric problems over data streams |
166
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Data is often collected over a distributed network, but in many cases, is so voluminous that it is impractical and undesirable to collect it in a central location. Instead, we mus...
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
This paper describes an algorithm for determining if an event occurs persistently within an interval where the interval is periodic but the event is not. The goal of the algorithm...
112
click to vote
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—Many emerging information processing applications require applying various fork and join type operations such as correlation, aggregation, and encoding/decoding to data streams ...
CGO
2006
IEEE
15 years 1 months ago
2006
IEEE
Modern computer systems are called on to deal with billions of events every second, whether they are instructions executed, memory locations accessed, or packets forwarded. This p...
SGP
2004
15 years 12 days ago
2004
Numerous mesh algorithms such as parametrization, radiosity, and collision detection require the decomposition of meshes into a series of clusters. In this paper we present two no...