13214 search results - page 16 / 2643 » Pseudorandomness for network algorithms |
APPROX
2005
Springer
15 years 5 months ago
2005
Springer
Constructions of k-wise almost independent permutations have been receiving a growing amount of attention in recent years. However, unlike the case of k-wise independent functions...
146
click to vote
ICALP
2011
Springer
14 years 3 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
ICNP
2006
IEEE
15 years 5 months ago
2006
IEEE
— Energy efficiency is widely understood to be one of the dominant considerations for Wireless Sensor Networks. Based on historical data and technology trends, the receiver ener...
169
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
We present a new technique for using samples to estimate join cardinalities. This technique, which we term "end-biased samples," is inspired by recent work in network tr...