5 search results - page 1 / 1 » MVSink: Incrementally Building In-Network Aggregation Trees |
EWSN
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. In-network data aggregation is widely recognized as an acceptable means to reduce the amount of transmitted data without adversely affecting the quality of the results. T...
EDBT
2004
ACM
14 years 4 months ago
2004
ACM
Earlier work has demonstrated the effectiveness of in-network data aggregation in order to minimize the amount of messages exchanged during continuous queries in large sensor netwo...
IPPS
2002
IEEE
13 years 9 months ago
2002
IEEE
Most current work in data mining assumes that the database is static, and a database update requires rediscovering all the patterns by scanning the entire old and new database. Su...
PPOPP
2003
ACM
13 years 9 months ago
2003
ACM
Large-scale cluster-based Internet services often host partitioned datasets to provide incremental scalability. The aggregation of results produced from multiple partitions is a f...
ATVA
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...