Sciweavers

14 search results - page 3 / 3
» Tight Bounds for Delay-Sensitive Aggregation
Sort
View
AAAI
2006
13 years 6 months ago
Quantifying Incentive Compatibility of Ranking Systems
Reasoning about agent preferences on a set of alternatives, and the aggregation of such preferences into some social ranking is a fundamental issue in reasoning about multi-agent ...
Alon Altman, Moshe Tennenholtz
GRID
2006
Springer
13 years 5 months ago
Multi-Replication with Intelligent Staging in Data-Intensive Grid Applications
Existing data grid scheduling systems handle huge data I/O via replica location services coupled with simple staging, decoupled from scheduling of computing tasks. However, when th...
Yuya Machida, Shin'ichiro Takizawa, Hidemoto Nakad...
DKE
2008
79views more  DKE 2008»
13 years 5 months ago
Extracting k most important groups from data efficiently
We study an important data analysis operator, which extracts the k most important groups from data (i.e., the k groups with the highest aggregate values). In a data warehousing co...
Man Lung Yiu, Nikos Mamoulis, Vagelis Hristidis
PODS
2005
ACM
96views Database» more  PODS 2005»
13 years 10 months ago
Space complexity of hierarchical heavy hitters in multi-dimensional data streams
Heavy hitters, which are items occurring with frequency above a given threshold, are an important aggregation and summary tool when processing data streams or data warehouses. Hie...
John Hershberger, Nisheeth Shrivastava, Subhash Su...