Sciweavers

64 search results - page 3 / 13
» First Order Random Forests with Complex Aggregates
Sort
View
PODS
2006
ACM
96views Database» more  PODS 2006»
15 years 9 months ago
Efficient gossip-based aggregate computation
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 ...
Srinivas R. Kashyap, Supratim Deb, K. V. M. Naidu,...
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
15 years 11 months ago
Sketch-Based Summarization of Ordered XML Streams
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...
Veronica Mayorga, Neoklis Polyzotis
TCOM
2010
83views more  TCOM 2010»
14 years 4 months ago
Early-Elimination Modification for Priority-First Search Decoding
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...
Shin-Lin Shieh, Po-Ning Chen, Yunghsiang S. Han, T...
ICDE
2004
IEEE
102views Database» more  ICDE 2004»
15 years 10 months ago
Approximate Temporal Aggregation
Temporal aggregate queries retrieve summarized information about records with time-evolving attributes. Existing approaches have at least one of the following shortcomings: (i) th...
Yufei Tao, Dimitris Papadias, Christos Faloutsos
ALGOSENSORS
2009
Springer
14 years 7 months ago
Brief Announcement: Universal Data Aggregation Trees for Sensor Networks in Low Doubling Metrics
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...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...