O(log log N) Time Algorithms for Hamiltonian-Suffix and Min-Max-Pair Heap Operations on Hypercube Multicomputers.
Sajal K. DasMaria Cristina PinottiPublished in: IPPS (1997)
Keyphrases
- min max
- data structure
- worst case
- suffix tree
- computational efficiency
- orders of magnitude
- neural network
- optimization problems
- website
- learning algorithm
- lower bound
- evolutionary algorithm
- significant improvement
- computational cost
- data mining algorithms
- computationally expensive
- times faster
- convergence rate
- data mining