COMS W4205 Combinatorial Methods.ppt

COMS W4205 Combinatorial Methods Prof. Jonathan Gross Sequences Ordinary Generating Functions, Asymptotic Estimates Solving Recurrences Evaluating Sums Finite Calculus, Inclusion-Exclusion Subsets and Binomials Applications to Statistics, The Catalan Recurrence Integer Operators Euclidean Algorithm, Chinese Remainder Theorem Partitions and Permutations Stirling Numbers, Exponential Generating Functions Graph Enumeration Burnside-Polya Counting Combinatorial Designs Latin Squares, Balanced Block Designs, Finite Geometries, Projective Planes, Affine Planes COMS W4252: Introduction to Computational Learning Theory Theoretical foundation of machine learning Focus on provably correct and efficient learning algorithms Connections with artificial intelligence, statistics, theoretical computer science Counts as required track course for Machine Learning MS track, track elective for Foundations of Computer Science MS track Contact instructor (Rocco Servedio, rocco@) with any questions CSEE 4823: Advanced Logic DesignProf. Steven Nowick Course Focus: advanced course in modern digital design Pre-Requisites: basics (half-semester) of digital design = Combinational logic: truth tables, Karnaugh maps, basic combinational design Sequential logic: basic exposure -- latches, flipflops, state machines Covers: Advanced digital logic topics Designing controllers (Mealy/Moore state machines) High-speed adders (carry-lookahead, Kogge-Stone)/multipliers Structured logic blocks (PALs, PLDs, ROMS) Arbiters/synchronizers Asynchronous (clockless) circuits Introduction to modern industrial design methodology “hardware description languages” for specification/design (VHDL) Introduction to CAD tools: modelling + simulation Real-world design applications Note -- not primarily a lab course, but includes “mini-project” Provides: Strong background for advanced digital/embedded systems and computer architecture courses Good background for industrial positions Contact: Prof. Steven Nowick,