Sciweavers

606 search results - page 111 / 122
» Memory-constrained aggregate computation over data streams
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 1 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
KDD
2003
ACM
449views Data Mining» more  KDD 2003»
15 years 9 months ago
Passenger-based predictive modeling of airline no-show rates
Airlines routinely overbook flights based on the expectation that some fraction of booked passengers will not show for each flight. Accurate forecasts of the expected number of no...
Richard D. Lawrence, Se June Hong, Jacques Cherrie...
CLUSTER
2004
IEEE
15 years 1 months ago
An efficient end-host architecture for cluster communication
Cluster computing environments built from commodity hardware have provided a cost-effective solution for many scientific and high-performance applications. Likewise, middleware te...
Xin Qi, Gabriel Parmer, Richard West
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
15 years 9 months ago
Efficient and effective explanation of change in hierarchical summaries
Dimension attributes in data warehouses are typically hierarchical (e.g., geographic locations in sales data, URLs in Web traffic logs). OLAP tools are used to summarize the measu...
Deepak Agarwal, Dhiman Barman, Dimitrios Gunopulos...
DMSN
2009
ACM
15 years 4 months ago
Validated cost models for sensor network queries
Generating a good execution plan for a declarative query has long been a central problem in data management research. With the rise in interest in wireless sensor networks (WSNs) ...
Christian Y. A. Brenninkmeijer, Ixent Galpin, Alva...