149 search results - page 8 / 30 » Uniform hashing in constant time and linear space |
NETWORKING
2004
13 years 10 months ago
2004
In this paper we propose a new packet classification algorithm, which can substantially improve the performance of a classifier by decreasing the rulebase lookup latency. The algor...
ENTCS
2006
13 years 8 months ago
2006
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
CSCLP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
SIAMCOMP
2002
13 years 8 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...