An improvement to the bit stuffing algorithm.
Sharon AviranPaul H. SiegelJack K. WolfPublished in: ISIT (2004)
Keyphrases
- times faster
- np hard
- detection algorithm
- dynamic programming
- improved algorithm
- optimization algorithm
- segmentation algorithm
- recognition algorithm
- k means
- single pass
- experimental evaluation
- computational cost
- learning algorithm
- computationally efficient
- theoretical analysis
- search space
- linear programming
- data compression
- hash table
- bit vectors
- convex hull
- simulated annealing
- high accuracy
- worst case
- probabilistic model
- preprocessing
- computational complexity