Sciweavers

1147 search results - page 57 / 230
» Statistical Timing Analysis Using Bounds
Sort
View
ICDCS
2010
IEEE
14 years 23 days ago
P2P Streaming Capacity under Node Degree Bound
—Two of the fundamental problems in peer-to-peer (P2P) streaming are as follows: what is the maximum streaming rate that can be sustained for all receivers, and what peering algo...
Shao Liu, Minghua Chen, Sudipta Sengupta, Mung Chi...
RTCSA
2007
IEEE
14 years 3 months ago
Fast Schedulability Analysis Using Commodity Graphics Hardware
In this paper we explore the possibility of using commodity graphics processing units (GPUs) to speedup standard schedulability analysis algorithms. Our long-term goal is to explo...
Jimin Feng, Samarjit Chakraborty, Bertil Schmidt, ...
JMLR
2012
11 years 11 months ago
Beyond Logarithmic Bounds in Online Learning
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
Francesco Orabona, Nicolò Cesa-Bianchi, Cla...
GIS
2009
ACM
14 years 3 months ago
Towards a probabilistic time geography
Time geography uses space-time volumes to represent the possible locations of a mobile agent over time in a x-y-t space. Space-time volumes are qualitative statements, enabling qu...
Stephan Winter
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
13 years 6 months ago
Tight Bounds for Delay-Sensitive Aggregation
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...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...