Searching for authors named "Johannes Gehrke" – sorted by Relevance.
86 documents found, showing 1 through 10.
Next 10 →
-
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
-
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
-
Query Processing over Device Networks
- …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 …
- Add To MetaCart
-
Mining Very Large Databases
- …this article was supported by Grant 2053 from the IBM Corp.…
- Cited by 38 (0 self) – Add To MetaCart
-
CACTUS - Clustering Categorical Data Using Summaries
- …Clustering is an important data mining problem. Most of the earlier work on clustering focussed on numeric attributes which have a natural ordering on their attribute values. Recently, clustering data with categorical attributes, whose attribute values do not have a natural ordering, has received so…
- Cited by 62 (0 self) – Add To MetaCart
-
How to Quickly Find a Witness
- …The subfield of itemset mining is essentially a collection of algorithms. Whenever a new type of constraint is discovered, a specialized algorithm is proposed to handle it. All of these algorithms are highly tuned to take advantage of the unique properties of their associated constraints, and so the…
- Cited by 11 (0 self) – Add To MetaCart
-
P-tree: a p2p index for resource discovery applications
- …We propose a new distributed, fault-tolerant Peer-to-Peer index structure for resource discovery applications called the P-tree. P-trees can efficiently support range queries in addition to equality queries. 1.…
- Cited by 5 (0 self) – Add To MetaCart
-
Identifying Temporal Patterns and Key Players in Document Collections
- …This paper considers the problem of analyzing the development of a document collection over time without requiring meaningful citation data. Given a collection of timestamped documents, we formulate and explore the following two questions. First, what are the main topics and how do these topics deve…
- Cited by 3 (1 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
