64 search results - page 3 / 13 » First Order Random Forests with Complex Aggregates |
129
Voted
PODS
2006
ACM
16 years 3 months ago
2006
ACM
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...
245
click to vote
ICDE
2009
IEEE
16 years 4 months ago
2009
IEEE
XML streams, such as RSS feeds or complex event streams, are becoming increasingly pervasive as they provide the foundation for a wide range of emerging applications. An important...
129
click to vote
TCOM
2010
14 years 9 months ago
2010
Abstract--In order to release the growing demand for computational complexity with respect to increasing information sequence length in the priority-first search decoding algorithm...
210
click to vote
ICDE
2004
IEEE
16 years 4 months ago
2004
IEEE
Temporal aggregate queries retrieve summarized information about records with time-evolving attributes. Existing approaches have at least one of the following shortcomings: (i) th...
163
click to vote
ALGOSENSORS
2009
Springer
15 years 27 days ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...