Sciweavers

219 search results - page 8 / 44
» Time and Space Lower Bounds for Implementations Using k-CAS
Sort
View
INFOCOM
2010
IEEE
13 years 6 months ago
On Space-Time Capacity Limits in Mobile and Delay Tolerant Networks
We investigate the fundamental capacity limits of space-time journeys of information in mobile and Delay Tolerant Networks (DTNs), where information is either transmitted or carrie...
Philippe Jacquet, Bernard Mans, Georgios Rodolakis
JEC
2006
113views more  JEC 2006»
13 years 8 months ago
CyNC: A method for real time analysis of systems with cyclic data flows
The paper addresses a novel method for realtime analysis of systems with cyclic data flows. The presented method is based on Network Calculus principles, where upper and lower flo...
Henrik Schiøler, Jens Dalsgaard Nielsen, Ki...
DATE
2003
IEEE
116views Hardware» more  DATE 2003»
14 years 1 months ago
Statistical Timing Analysis Using Bounds
The growing impact of within-die process variation has created the need for statistical timing analysis, where gate delays are modeled as random variables. Statistical timing anal...
Aseem Agarwal, David Blaauw, Vladimir Zolotov, Sar...
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 8 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
ICDT
2009
ACM
148views Database» more  ICDT 2009»
14 years 9 months ago
Tight results for clustering and summarizing data streams
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
Sudipto Guha