Efficient approximation of symbolic network functions using matroid intersection algorithms.
Qicheng YuCarl SechenPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (1997)
Keyphrases
- computationally efficient
- computationally expensive
- computationally intensive
- efficient implementation
- computationally complex
- computational cost
- optimization problems
- theoretical analysis
- uniform sampling
- approximation schemes
- significant improvement
- combinatorial optimization
- complexity analysis
- connectionist networks
- submodular functions
- basis functions
- exact computation
- learning algorithm