A Time Efficient Algorithm Based on Bloom Filters for Longest Prefix Matching in IP Lookups.
Ming YuDongju WangPublished in: J. Comput. (2013)
Keyphrases
- matching algorithm
- computationally efficient
- single pass
- detection algorithm
- learning algorithm
- dynamic programming
- objective function
- machine learning
- optimal solution
- approximate matching
- space efficient
- bloom filter
- probabilistic model
- string matching
- tree structure
- feature points
- multi dimensional
- data sets
- k means
- search space
- preprocessing
- data structure
- databases