|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
Set manipulation techniques, divide-and-conquer methods, the greedy method, dynamic programming, algorithms on graphs, backtracking, branch-and-bound, lower bound theory, NP-hard and NP-complete problems, approximation algorithms. Prerequisite: CS 250. SPRING.
-
3.00 Credits
Algorithms for dealing with special classes of graphs. Particular emphasis is given to subclasses of perfect graphs and graphs that can be stored in a small amount of space. Interval, chordal, permutation, comparability, and circular-arc graphs; graph decomposition. Prerequisite: CS 310 or MATH 275.
-
3.00 Credits
Systems verification and validation, industrial case studies, propositional and predicate logic, syntax and semantics of computational tree and linear time logics, binary decision diagrams, timed automata model and real-time verification, hands on experience with model checking using the SMV, SPIN and UPPAAL tools, and state reduction techniques. FALL.
-
3.00 Credits
Design and analysis of parallel algorithms for sorting, searching, matrix processing, FFT, optimization, and other problems. Existing and proposed parallel architectures, including SIMD machines, MIMD machines, and VLSI systolic arrays. Prerequisite: CS 310 or consent of instructor.
-
3.00 Credits
Theory and practice of parallel distributed processing methods using networks of neuron-like computational devices. Neurobiological inspirations, attractor networks, correlational and error-correction learning, regularization, unsupervised learning, reinforcement learning, Bayesian and information theoretic approaches, hardware support, and engineering applications. SPRING.
-
3.00 Credits
Current research issues and problems in computer animation, with special focus on motion capture, dynamic simulation, and key-framing. Cloth, deformable bodies, natural phenomena, geometric algorithms, procedural techniques, facial animation, hair, autonomous characters, flocking, empirical evaluation, and interfaces for animation. Prerequisite: CS 259 or consent of instructor. FALL.
-
3.00 Credits
An overview of human computer interaction and problems of current interest. Topics include: Human factors, GOMS, user interface design and evaluation, interaction modalities, distributed cognition, ubiquitous computing. A project involving design and evaluation will be performed. Prerequisite: consent of instructor. FALL.
-
3.00 Credits
(Also listed as EECE 358) The fundamentals of computer vision and techniques for image understanding and high-level image processing. Includes image segmentation, geometric structures, relational structures, motion, matching, inference, and vision systems. Prerequisite: CS 357 or EECE 357. SPRING.
-
3.00 Credits
Foundations of medical image registration. Mathematical methods and practical applications. Imageto- image registration, image-to-physical registration, applications to image-guided procedures and the most commonly used imaging modalities with an emphasis on tomographic images. FALL.
-
3.00 Credits
Discussion of state-of-theart and current research issues in heuristic search, knowledge representation, deduction, and reasoning. Related application areas include: planning systems, qualitative reasoning, cognitive models of human memory, user modeling in ICAI, reasoning with uncertainty, knowledgebased system design, and language comprehension. Prerequisite: CS 260 or equivalent. FALL.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|