Sciweavers

210 search results - page 2 / 42
» Excludability and Bounded Computational Capacity
Sort
View
INFOCOM
2002
IEEE
13 years 10 months ago
On the capacity of wireless networks: The relay case
Abstract— In [1], Gupta and Kumar determined the capacity of wireless networks under certain assumptions, among them point-to-point coding, which excludes for example multi-acces...
Michael Gastpar, Martin Vetterli
ATS
2005
IEEE
100views Hardware» more  ATS 2005»
13 years 11 months ago
A Methodology to Compute Bounds on Crosstalk Effects in Arbitrary Interconnects
In this paper, we present a methodology that uses the moments of a generic crosstalk pulse signal to derive upper bounds on the amplitude of crosstalk pulse in arbitrary interconn...
Wichian Sirisaengtaksin, Sandeep K. Gupta
WCET
2008
13 years 6 months ago
Computing time as a program variable: a way around infeasible paths
Conditional branches connect the values of program variables with the execution paths and thus with the execution times, including the worstcase execution time (WCET). Flow analys...
Niklas Holsti
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 5 months ago
Approximate max-integral-flow/min-multicut theorems
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
Kenji Obata