14 search results - page 1 / 3 » Tight Bounds for Delay-Sensitive Aggregation |
DMTCS
2010
13 years 1 months ago
2010
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
DAC
1995
ACM
13 years 8 months ago
1995
ACM
Abstract We observe that the switching activity at a circuit node, also called the transition density, can be extremely sensitive to the circuit internal delays. As a result, sligh...
DMDW
2001
13 years 6 months ago
2001
Accurately estimating the cardinality of aggregate views is crucial for logical and physical design of data warehouses. While the warehouse is under development and data are not a...
NIPS
2004
13 years 6 months ago
2004
We study a method of optimal data-driven aggregation of classifiers in a convex combination and establish tight upper bounds on its excess risk with respect to a convex loss funct...
INFORMATICALT
2010
13 years 3 months ago
2010
Abstract. As a means of supporting quality of service guarantees, aggregate multiplexing has attracted a lot of attention in the networking community, since it requires less comple...