WEA
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
WEA
2005
Springer
14 years 5 months ago
2005
Springer
WEA
2005
Springer
14 years 5 months ago
2005
Springer
We propose a novel algorithm based on random graphs to construct minimal perfect hash functions h. For a set of n keys, our algorithm outputs h in expected time O(n). The evaluatio...
WEA
2005
Springer
14 years 5 months ago
2005
Springer
WEA
2005
Springer
14 years 5 months ago
2005
Springer
WEA
2005
Springer
14 years 5 months ago
2005
Springer
WEA
2005
Springer
14 years 5 months ago
2005
Springer
WEA
2005
Springer
14 years 5 months ago
2005
Springer
We point out that for two sets of measurements, the sign of the difference of their averages is not necessarily maintained by a non-linear monotone transformation of the individu...
WEA
2005
Springer
14 years 5 months ago
2005
Springer
WEA
2005
Springer
14 years 5 months ago
2005
Springer
We consider the problem of finding a door along a wall with a blind robot that neither knows the distance to the door nor the direction towards of the door. This problem can be so...