M-DFA (multithreaded DFA): an algorithm for reduction of state transitions and acceleration of REGEXP matching.
Cheng-Hung LinJyh-Charn LiuPublished in: ANCS (2012)
Keyphrases
- matching algorithm
- learning algorithm
- computational complexity
- detection algorithm
- cost function
- similarity measure
- preprocessing
- state transitions
- search space
- data model
- significant improvement
- dynamic programming
- np hard
- worst case
- simulated annealing
- k means
- optimal solution
- particle swarm optimization
- expectation maximization
- objective function
- database systems
- image matching
- databases