Sciweavers

3208 search results - page 215 / 642
» A Lower Bound for Primality
Sort
View
FGCN
2007
IEEE
126views Communications» more  FGCN 2007»
16 years 27 days ago
Traffic Splitting with Network Calculus for Mesh Sensor Networks
In many applications of sensor networks, it is essential to ensure that messages are transmitted to their destinations as early as possible and the buffer size of each sensor node...
Huimin She, Zhonghai Lu, Axel Jantsch, Li-Rong Zhe...
COMPGEOM
2010
ACM
15 years 11 months ago
Lines avoiding balls in three dimensions revisited
Let B be a collection of n arbitrary balls in R3 . We establish an almost-tight upper bound of O(n3+ε ), for any ε > 0, on the complexity of the space F(B) of all the lines t...
Natan Rubin
DATE
1998
IEEE
93views Hardware» more  DATE 1998»
15 years 11 months ago
Exact and Approximate Estimation for Maximum Instantaneous Current of CMOS Circuits
We present an integer-linear-programming-based approach for estimating the maximum instantaneous current through the power supply lines for CMOS circuits. It produces the exact so...
Yi-Min Jiang, Kwang-Ting Cheng
FOCS
1990
IEEE
15 years 10 months ago
Complexity of Unification in Free Groups and Free Semi-groups
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
Antoni Koscielski, Leszek Pacholski
ASIACRYPT
2001
Springer
15 years 10 months ago
Autocorrelation Coefficients and Correlation Immunity of Boolean Functions
Abstract. We apply autocorrelation and Walsh coefficients for the investigation of correlation immune and resilient Boolean functions. We prove new lower bound for the absolute ind...
Yuriy Tarannikov, Peter Korolev, Anton Botev