Sciweavers

502 search results - page 69 / 101
» Streaming Random Forests
Sort
View
EDBT
2004
ACM
122views Database» more  EDBT 2004»
14 years 10 months ago
Sketch-Based Multi-query Processing over Data Streams
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
ICDE
2007
IEEE
155views Database» more  ICDE 2007»
14 years 4 months ago
Query-Aware Sampling for Data Streams
Data Stream Management Systems are useful when large volumes of data need to be processed in real time. Examples include monitoring network traffic, monitoring financial transacti...
Theodore Johnson, S. Muthukrishnan, Vladislav Shka...
PODS
2010
ACM
232views Database» more  PODS 2010»
14 years 2 months ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
13 years 9 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
MM
2005
ACM
184views Multimedia» more  MM 2005»
14 years 3 months ago
A peer-to-peer network for live media streaming using a push-pull approach
In this paper, we present an unstructured peer-to-peer network called GridMedia for live media streaming employing a push-pull approach. Each node in GridMedia randomly selects it...
Meng Zhang, Jian-Guang Luo, Li Zhao, Shi-Qiang Yan...