Algorithms for the Problem of K Maximum Sums and a VLSI Algorithm for the K Maximum Subarrays Problem.
Sung Eun BaeTadao TakaokaPublished in: ISPAN (2004)
Keyphrases
- times faster
- computational complexity
- learning algorithm
- computational cost
- theoretical analysis
- computationally efficient
- worst case
- single pass
- computational efficiency
- significant improvement
- recently developed
- related algorithms
- optimization problems
- synthetic and real datasets
- classification algorithm
- simulated annealing
- dynamic programming
- cost function
- iterative algorithms
- algorithms require
- exhaustive search
- optimization algorithm
- empirical analyses
- combinatorial optimization
- benchmark problems
- filtering algorithm
- nearest neighbour
- synthetic and real world datasets
- algorithm has been developed
- incremental version
- provably convergent
- convergence rate
- hybrid algorithm
- search space
- k means
- linear programming
- detection algorithm
- clustering algorithm
- maximum flow
- preprocessing
- theoretical guarantees
- synthetic datasets
- space complexity
- solution quality
- random variables
- np hard
- parallel implementation
- computationally intensive
- data structure
- memory requirements
- incremental algorithms
- optimal solution
- objective function
- reinforcement learning