Strong I/O Lower Bounds for Binomial and FFT Computation Graphs.
Desh RanjanJohn E. SavageMohammad ZubairPublished in: COCOON (2011)
Keyphrases
- lower bound
- random accesses
- random access
- upper bound
- input output
- subgraph isomorphism
- lower and upper bounds
- branch and bound
- branch and bound algorithm
- objective function
- graph matching
- graph theory
- fourier transform
- frequency domain
- np hard
- graph theoretic
- probability distribution
- fast fourier transform
- file system
- weighted graph
- graph mining
- image registration
- learning automata
- storage cost
- optimal solution