Checking dynamic consistency of conditional hyper temporal networks via mean payoff games: Hardness and (pseudo) singly-exponential time algorithm.
Carlo CominRomeo RizziPublished in: Inf. Comput. (2018)
Keyphrases
- preprocessing
- dynamic programming
- worst case
- computational complexity
- linear complexity
- cost function
- np hard
- segmentation algorithm
- computational cost
- randomly generated
- matching algorithm
- detection algorithm
- global consistency
- k means
- optimal solution
- weighted majority
- objective function
- space complexity
- convergence rate
- spatial and temporal
- monte carlo
- expectation maximization
- spatio temporal