University of Louisiana at Lafayette
Basic techniques used in design and analysis of algorithms, including divide-and-conquer, greed methods, dynamic programming, search techniques, backtracking, brand-and-bound, and algebraic transformation. NP-Complete and NP-Hard problems, reductions among and approximations to such problems. Basis concepts surrounding the halting problem.
- Teacher: Min Shi
Review of 2-D digital signal processing, fast transform algorithms, image processing techniques; image enhancement, filtering, restoration, segmentation; image modeling; data compression for image storage and transmission; image reconstruction from noisy projections, data base structure; hardware implementation; applications in communication; medical, and computer vision.
- Teacher: Hao Zheng