Sciweavers

1139 search results - page 118 / 228
» Bounded Ideation Theory
Sort
View
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
14 years 8 months ago
Optimal approximations of the frequency moments of data streams
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
Piotr Indyk, David P. Woodruff
PODS
2006
ACM
122views Database» more  PODS 2006»
14 years 8 months ago
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...
EDBT
2008
ACM
137views Database» more  EDBT 2008»
14 years 8 months ago
Optimizing away joins on data streams
Abstract. Monitoring aggregates on IP traffic data streams is a compelling application for data stream management systems. Often, such streaming aggregation queries involve joining...
Lukasz Golab, Theodore Johnson, Nick Koudas, Dives...
GLOBECOM
2009
IEEE
14 years 2 months ago
Impact of Information on Network Performance - An Information-Theoretic Perspective
Abstract—Available network information is an important factor in determining network performance. In this paper, we study the basic limits on the amount of network information th...
Jun Hong, Victor O. K. Li
IPPS
2009
IEEE
14 years 2 months ago
Multi-users scheduling in parallel systems
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
Erik Saule, Denis Trystram