713 search results - page 62 / 143 » Dispersing Hash Functions |
STACS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
155
click to vote
Publication
Using a trace of address references, we compared the efficiency of several different hashing functions, such as cyclic redundancy checking (CRC) polynomials, Fletcher checksum, fol...
WEA
2005
Springer
15 years 3 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...
JSAC
2006
14 years 9 months ago
2006
End-to-end packet-pair probing has been used as one of the primary mechanisms to measure bottleneck capacity, crosstraffic intensity, and available bandwidth of end-to-end Internet...
111
click to vote
SIGCOMM
2012
ACM
13 years 7 days ago
2012
ACM
A fundamental problem in wireless networks is to develop communication protocols that achieve high throughput in the face of noise, interference, and fading, all of which vary wit...