Sciweavers

1576 search results - page 48 / 316
» Streaming Algorithms for Independent Sets
Sort
View
JCST
2006
65views more  JCST 2006»
14 years 9 months ago
P-Tree Structures and Event Horizon: Efficient Event-Set Implementations
This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree (or IP-tree, BP-tree, and IBP-tree, respectively, for short), for...
Katerina Asdre, Stavros D. Nikolopoulos
ICDT
2003
ACM
106views Database» more  ICDT 2003»
15 years 3 months ago
Processing XML Streams with Deterministic Automata
We consider the problem of evaluating a large number of XPath expressions on an XML stream. Our main contribution consists in showing that Deterministic Finite Automata (DFA) can b...
Todd J. Green, Gerome Miklau, Makoto Onizuka, Dan ...
ICDE
2009
IEEE
202views Database» more  ICDE 2009»
15 years 11 months ago
Tracking High Quality Clusters over Uncertain Data Streams
Recently, data mining over uncertain data streams has attracted a lot of attentions because of the widely existed imprecise data generated from a variety of streaming applications....
Chen Zhang, Ming Gao, Aoying Zhou
INFOCOM
2011
IEEE
14 years 1 months ago
Multi-path routing and rate allocation for multi-source video on-demand streaming in wireless mesh networks
Abstract—We study the multi-source video on-demand application in multi-channel multi-radio wireless mesh networks. When a user initiates a new video request, the application can...
Yong Ding, Yang Yang, Li Xiao
PODS
2010
ACM
215views Database» more  PODS 2010»
15 years 2 months ago
An optimal algorithm for the distinct elements problem
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
Daniel M. Kane, Jelani Nelson, David P. Woodruff