197 search results - page 16 / 40 » Simple deterministic approximation algorithms for counting m... |
113
click to vote
ISAAC
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
185
click to vote
SIGCOMM
2006
ACM
15 years 7 months ago
2006
ACM
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
SODA
2010
ACM
15 years 10 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
115
click to vote
SIGCOMM
2006
ACM
15 years 7 months ago
2006
ACM
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...