[PORTALNAME]
Toggle menu
Home
Search
Search
Search Transfer Schools
Search for Course Equivalencies
Search for Exam Equivalencies
Search for Transfer Articulation Agreements
Search for Programs
Search for Courses
PA Bureau of CTE SOAR Programs
Transfer Student Center
Transfer Student Center
Adult Learners
Community College Students
High School Students
Traditional University Students
International Students
Military Learners and Veterans
About
About
Institutional information
Transfer FAQ
Register
Login
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
CMSC 34200: Numerical Hydrodynamics
3.00 Credits
University of Chicago
PQ: Ability to program; and familiarity with elementary numerical methods and modeling physical systems by systems of differential equations. This course covers numerical methods for the solution of fluid flow problems. We also make a theoretical evaluation of the methods and experimental study based on the opinionated book Fundamentals of Computational Fluid Dynamics by Patrick J. Roache. T. Dupont. Spring.
Share
CMSC 34200 - Numerical Hydrodynamics
Favorite
CMSC 34710: Wireless Sensor Networks
3.00 Credits
University of Chicago
PQ: Graduate-level understanding of Unix/Linux operating systems, networking, computer architecture, and programming. This course introduces the concepts and technologies for building embedded systems and wireless sensors nets by focusing on four areas: low-power hardware, wireless networking, embedded operating systems, and sensors. Two assignments provide hands-on experience by deploying small wireless sensor motes running TinyOS to form an ad-hoc peer-to-peer network that can collect environmental data and forward it back to an 802.11b-equiped embedded Linux module. Students also read and summarize papers, participate in classroom discussions, and work on a team research project. R. Stevens. Not offered 2009 C10; will be offered 201 0 -11.
Share
CMSC 34710 - Wireless Sensor Networks
Favorite
CMSC 35000: Introduction to Artificial Intelligence
3.00 Credits
University of Chicago
PQ: CMSC 25000. This course is an introduction to the theoretical, technical, and philosophical aspects of Artificial Intelligence. The emphasis is on computational and mathematical modes of inquiry into the structure and function of intelligent systems. Topics include learning and inference, speech and language, vision and robotics, and reasoning and search. P. Niyogi. Winter.
Share
CMSC 35000 - Introduction to Artificial Intelligence
Favorite
CMSC 35100: Natural Language Processing
3.00 Credits
University of Chicago
PQ: CMSC 25000/35000 or consent of instructor. This course is an introduction to the theory and practice of natural language processing, with applications to both text and speech. Topics include regular expressions, finite state automata, morphology, part of speech tagging, context free grammars, parsing, semantics, discourse, and dialogue. Symbolic and probabilistic models are presented. Techniques for automatic acquisition of linguistic knowledge are emphasized. Spring. Not offered 2009 C10; will be offered 201 0 -11.
Share
CMSC 35100 - Natural Language Processing
Favorite
CMSC 35400: Machine Learning
3.00 Credits
University of Chicago
PQ: CMSC 25000/35000 or consent of instructor. This course is an introduction to the theory and practice of machine learning that emphasizes statistical approaches to the problem. Topics include pattern recognition, empirical risk minimization and the Vapnik Chervonenkis theory, neural networks, decision trees, genetic algorithms, unsupervised learning, and multiple classifiers. P. Niyogi. Spring.
Share
CMSC 35400 - Machine Learning
Favorite
CMSC 35500: Computer Vision
3.00 Credits
University of Chicago
PQ: Consent of instructor. This course covers deformable models for detecting objects in images. Topics include one-dimensional models to identify object contours and boundaries; two-dimensional models for image matching; and sparse models for efficient detection of objects in complex scenes. Mathematical tools needed to define the models and associated algorithms are developed. Applications include detecting contours in medical images, matching brains, and detecting faces in images. Neural network implementations of some of the algorithms are presented, and connections to the functions of the biological visual system are discussed. Y. Amit. Winter.
Share
CMSC 35500 - Computer Vision
Favorite
CMSC 35900: Topics in Artificial Intelligence
3.00 Credits
University of Chicago
PQ: Consent of instructor. This course covers topics in artificial intelligence. Autumn, Winter, Spring.
Share
CMSC 35900 - Topics in Artificial Intelligence
Favorite
CMSC 36500: Algorithms in Finite Groups
3.00 Credits
University of Chicago
PQ: Linear algebra, finite fields, and a first course in group theory (Jordan-Holder and Sylow theorems) required; prior knowledge of algorithms not required. We consider the asymptotic complexity of some of the basic problems of computational group theory. The course demonstrates the relevance of a mix of mathematical techniques, ranging from combinatorial ideas, the elements of probability theory, and elementary group theory, to the theories of rapidly mixing Markov chains, applications of simply stated consequences of the Classification of Finite Simple Groups (CFSG), and, occasionally, detailed information about finite simple groups. No programming problems are assigned. L. Babai. Spring. Not offered 2009 C10; will be offered 201 0 -11.
Share
CMSC 36500 - Algorithms in Finite Groups
Favorite
CMSC 37000: Algorithms
3.00 Credits
University of Chicago
PQ: CMSC 27200 or consent of instructor. The focus of this course is the analysis and design of efficient algorithms, with emphasis on ideas rather than on implementation. Algorithmic questions include sorting and searching, discrete optimization, algorithmic graph theory, algorithmic number theory, and cryptography. Design techniques include "divide-and-conquer" methods, dynamic programming, greedy algorithms, and graph search, as well as the design of efficient data structures. Methods of algorithm analysis include asymptotic notation, evaluation of recurrent inequalities, the concepts of polynomial-time algorithms, and NP-completeness . L. Babai. Winter.
Share
CMSC 37000 - Algorithms
Favorite
CMSC 37100: Topics in Algorithms
3.00 Credits
University of Chicago
PQ: CMSC 27200 or consent of instructor. This course discusses current topics in algorithms. Autumn, Winter, Spring.
Share
CMSC 37100 - Topics in Algorithms
Favorite
First
Previous
51
52
53
54
55
Next
Last
Results Per Page:
10
20
30
40
50
Search Again
To find college, community college and university courses by keyword, enter some or all of the following, then select the Search button.
College:
(Type the name of a College, University, Exam, or Corporation)
Course Subject:
(For example: Accounting, Psychology)
Course Prefix and Number:
(For example: ACCT 101, where Course Prefix is ACCT, and Course Number is 101)
Course Title:
(For example: Introduction To Accounting)
Course Description:
(For example: Sine waves, Hemingway, or Impressionism)
Distance:
Within
5 miles
10 miles
25 miles
50 miles
100 miles
200 miles
of
Zip Code
Please enter a valid 5 or 9-digit Zip Code.
(For example: Find all institutions within 5 miles of the selected Zip Code)
State/Region:
Alabama
Alaska
American Samoa
Arizona
Arkansas
California
Colorado
Connecticut
Delaware
District of Columbia
Federated States of Micronesia
Florida
Georgia
Guam
Hawaii
Idaho
Illinois
Indiana
Iowa
Kansas
Kentucky
Louisiana
Maine
Marshall Islands
Maryland
Massachusetts
Michigan
Minnesota
Minor Outlying Islands
Mississippi
Missouri
Montana
Nebraska
Nevada
New Hampshire
New Jersey
New Mexico
New York
North Carolina
North Dakota
Northern Mariana Islands
Ohio
Oklahoma
Oregon
Palau
Pennsylvania
Puerto Rico
Rhode Island
South Carolina
South Dakota
Tennessee
Texas
Utah
Vermont
Virgin Islands
Virginia
Washington
West Virginia
Wisconsin
Wyoming
American Samoa
Guam
Northern Marianas Islands
Puerto Rico
Virgin Islands