Efficient on-line algorithm for maintaining k-cover of sparse bit-strings.
Amit KumarPreeti Ranjan PandaSmruti R. SarangiPublished in: FSTTCS (2012)
Keyphrases
- single pass
- experimental evaluation
- computational complexity
- learning algorithm
- theoretical analysis
- k means
- computational cost
- times faster
- detection algorithm
- segmentation algorithm
- improved algorithm
- probabilistic model
- optimization algorithm
- preprocessing
- objective function
- dynamic programming
- np hard
- highly efficient
- significant improvement
- high efficiency
- neural network
- similarity measure
- recognition algorithm
- convergence rate
- matching algorithm
- computationally efficient
- expectation maximization
- cost function
- optimal solution
- evolutionary algorithm