Searching for authors named Johannes Gehrke – sorted by Relevance.
87 documents found, showing 1 through 10.
Next 10 →
-
On Computing Correlated Aggregates Over Continual Data Streams
- …A&$B?6@ 6&(!!"C 198 %D# F@6)! 280-45380 80 9890-46410 46410 2= + 28939-4747 /!C&$G# 5!& G# 28779 )IA).J3 &$)JKDL(MN(0OLAPAQ -44320 "/))08!! $'' ' )3 $)0T)!E0<#$)H?6*)7 #$ )':3">' 22820-432 ) #U!)'2$)
- Add To MetaCart
-
The Cougar Approach to In-Network Query Processing in Sensor Networks
- …The widespread distribution and availability of smallscale sensors, actuators, and embedded processors is transforming the physical world into a computing platform. One such example is a sensor network consisting of a large number of sensor nodes that combine physical sensing capabilities such as te…
- Cited by 189 (1 self) – Add To MetaCart
-
Querying the physical world
- …In the next decade, millions of sensors and small-scale mobile devices will integrate processors, memory and communication capabilities. Networks of devices will be widely deployed for monitoring applications. In these new applications, users need to query very large collections of devices in an ad-…
- Cited by 105 (1 self) – Add To MetaCart
-
Query Processing for Sensor Networks
- …Hardware for sensor nodes that combine physical sensors, actuators, embedded processors, and communication components has advanced significantly over the last decade, and made the large-scale deployment of such sensors a reality. Applications range from monitoring applications such as inventory main…
- Cited by 213 (4 self) – Add To MetaCart
-
Scheduling to Minimize Average Stretch
- …We consider the classical problem of online preemptive job scheduling on uniprocessor and multiprocessor machines. For a given job, we measure the quality of service provided by an algorithm by the stretch of the job, which is defined as the ratio of the amount of time that the job spends in the sys…
- Add To MetaCart
-
Online Scheduling to Minimize Average Stretch
- …We consider the classical problem of online job scheduling on uniprocessor and multiprocessor machines. For a given job, we measure the quality of service provided by an algorithm by the stretch of the job, which is defined as the ratio of the amount of time that the job spends in the system to the …
- Cited by 30 (1 self) – Add To MetaCart
-
Querying the Physical World
- …Data Type (ADT) objects that are single attribute values encapsulating a collection of related data [S98]. Note that there are natural parallels between devices and ADTs. Both ADTs and devices provide controlled access to encapsulated data through a well-defined interface. We build upon this observa…
- Add To MetaCart
-
Towards Sensor Database Systems
- …Sensor networks are being widely deployed for measurement, detection and surveillance applications. In these new applications, users issue long-running queries over a combination of stored data and sensor data. Most existing applications rely on a centralized system for collecting sensor data.…
- Add To MetaCart
-
Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings
- …We consider the problem of load balancing in a ring network. We present an analysis of the following local algorithm. In each step, each node of the ring examines the number of tokens at its clockwise neighbor and sends a token to the neighbor if the neighbor has fewer tokens. We show that in a s…
- Cited by 3 (1 self) – Add To MetaCart
-
Fast Scheduling of Periodic Tasks on Multiple Resources
- …Given n periodic tasks, each characterized by an execution requirement and a period, and m identical copies of a resource, the periodic scheduling problem is concerned with generating a schedule for the n tasks on the m resources. We present an algorithm that schedules every feasible instance of t…
- Cited by 83 (11 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
