2 search results - page 1 / 1 » Beyond bloom filters: from approximate membership checks to ... |
SIGCOMM
2006
ACM
13 years 10 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 ...
ACL
1997
13 years 6 months ago
1997
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...