An Almost Linear Time Approximation Algorithm for the Permanen of a Random (0-1) Matrix.
Martin FürerShiva Prasad KasiviswanathanPublished in: FSTTCS (2004)
Keyphrases
- experimental evaluation
- worst case
- high accuracy
- preprocessing
- dynamic programming
- theoretical analysis
- closed form
- recognition algorithm
- error bounds
- cost function
- image segmentation
- optimization algorithm
- objective function
- np hard
- detection algorithm
- computational complexity
- neural network
- linear programming
- similarity measure
- greedy algorithm
- approximation ratio
- expectation maximization
- input data
- least squares
- computational cost
- k means
- search space
- search algorithm