Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences.
Ricardo A. Baeza-YatesAlejandro SalingerPublished in: SPIRE (2005)
Keyphrases
- cost function
- optimal solution
- computational complexity
- detection algorithm
- dynamic programming
- computational cost
- learning algorithm
- times faster
- objective function
- preprocessing
- k means
- significant improvement
- optimization algorithm
- np hard
- theoretical analysis
- selection algorithm
- estimation algorithm
- single pass
- multi objective
- worst case
- sequence matching
- convergence rate
- long sequences
- matching algorithm
- expectation maximization
- linear programming
- high accuracy
- lower bound
- similarity measure