Sciweavers

468 search results - page 48 / 94
» Optimization of in-network data reduction
Sort
View
PODS
2008
ACM
159views Database» more  PODS 2008»
14 years 10 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor
PLDI
2003
ACM
14 years 3 months ago
Compile-time composition of run-time data and iteration reorderings
Many important applications, such as those using sparse data structures, have memory reference patterns that are unknown at compile-time. Prior work has developed runtime reorderi...
Michelle Mills Strout, Larry Carter, Jeanne Ferran...
CONEXT
2007
ACM
14 years 1 months ago
Fair and efficient scheduling in data ferrying networks
Data-ferrying disconnection-tolerant networks allow remote rural areas to access the Internet at very low cost, making them viable alternatives to more expensive access technologi...
Shimin Guo, Srinivasan Keshav
CLOUD
2010
ACM
14 years 3 months ago
Comet: batched stream processing for data intensive distributed computing
Batched stream processing is a new distributed data processing paradigm that models recurring batch computations on incrementally bulk-appended data streams. The model is inspired...
Bingsheng He, Mao Yang, Zhenyu Guo, Rishan Chen, B...
MIS
1999
Springer
84views Multimedia» more  MIS 1999»
14 years 2 months ago
Minimizing Bandwidth Requirements for On-Demand Data Delivery
Recent techniques for multicast or broadcast delivery of streaming media can provide immediate service to each client request yet achieve considerable client stream sharing (i.e.,...
Derek L. Eager, Mary K. Vernon, John Zahorjan