2019-2020 2020-2021 2021-2022 2022-2023 2023-2024
Browse
by subject...
    Schedule
view...
 

161 - 170 of 224 results for: CS

CS 348A: Computer Graphics: Geometric Modeling

The mathematical tools needed for the geometrical aspects of computer graphics and especially for modeling smooth shapes. Fundamentals: homogeneous coordinates, transformations, and perspective. Theory of parametric and implicit curve and surface models: polar forms, Bézier arcs and de Casteljau subdivision, continuity constraints, B-splines, tensor product, and triangular patch surfaces. Subdivision surfaces and multi-resolution representations of geometry. Representations of solids and conversions among them. Surface reconstruction from scattered data points. Geometry processing on meshes, including simplification and parameterization. Prerequisite: linear algebra. Recommended: 248.
Terms: Aut | Units: 3-4

CS 348B: Computer Graphics: Image Synthesis Techniques

Intermediate level, emphasizing high-quality image synthesis algorithms and systems issues in rendering. Topics include: Reyes and advanced rasterization, including motion blur and depth of field; ray tracing and physically based rendering; Monte Carlo algorithms for rendering, including direct illumination and global illumination; path tracing and photon mapping; surface reflection and light source models; volume rendering and subsurface scattering; SIMD and multi-core parallelism for rendering. Written assignments and programming projects. Prerequisite: 248 or equivalent. Recommended: Fourier analysis or digital signal processing.
Terms: Spr | Units: 3-4

CS 349: Topics in Programming Systems

Advanced material is often taught for the first time as a topics course, perhaps by a faculty member visiting from another institution. May be repeated for credit.
Last offered: Winter 2006 | Repeatable for credit

CS 349C: Topics in Programming Systems: Readings in Distributed Systems

Discussion of research publications that are of current interest in distributed systems. Students are expected to read all papers, and sign up for presentation of one paper. The course itself is 1 unit. Those interested in working on a project along with the readings should enroll for 3 units.
Last offered: Autumn 2010

CS 354: Topics in Circuit Complexity

An overview of circuit complexity, focusing on limitations of solving computational problems with circuits. Classical methods: diagonalization; the gate elimination method and circuit size lower bounds; the method of random restrictions and formula size lower bounds; approximating circuits with polynomials and depth-restricted lower bounds. Connections between circuit-analysis algorithms and circuit complexity: learning circuits via queries; pseudorandomness and derandomization; satisfiability algorithms. Prerequisite: CS254 or the equivalent mathematical maturity.
Terms: Spr | Units: 3

CS 357: Advanced Topics in Formal Methods

Topics vary annually. Recent offerings have covered the foundations of static analysis, including decision procedures for important theories (SAT, linear integer constraints, SMT solvers), model checking, abstract interpretation, and constraint-based analysis. May be repeated for credit. Prerequisite: 256.
Terms: Aut | Units: 3 | Repeatable for credit

CS 358: Topics in Programming Language Theory

Topics of current research interest in the mathematical analysis of programming languages, structured operational semantics, domain theory, semantics of concurrency, rich type disciplines, problems of representation independence, and full abstraction. See Time Schedule or Axess for current topics. May be repeated for credit. Prerequisites: 154, 157, 258, or equivalents. (Staff)
| Repeatable for credit

CS 359: Topics in the Theory of Computation

Advanced material is often taught for the first time as a topics course, perhaps by a faculty member visiting from another institution. May be repeated for credit.
Last offered: Spring 2005 | Repeatable for credit

CS 361: Introduction to Multidisciplinary Design Optimization (AA 222)

Design of aerospace systems within a formal optimization environment. Mathematical formulation of the multidisciplinary design problem (parameterization of design space, choice of objective functions, constraint definition); survey of algorithms for unconstrained and constrained optimization and optimality conditions; description of sensitivity analysis techniques. Hierarchical techniques for decomposition of the multidisciplinary design problem; use of approximation theory. Applications to design problems in aircraft and launch vehicle design. Prerequisites: multivariable calculus; familiarity with a high-level programming language: FORTRAN, C, C++, MATLAB, Python, or Julia.
Terms: Spr | Units: 3-4

CS 364A: Algorithmic Game Theory

Topics at the interface of computer science and game theory such as: algorithmic mechanism design; combinatorial auctions; computation of Nash equilibria and relevant complexity theory; congestion and potential games; cost sharing; game theory and the Internet; matching markets; network formation; online learning algorithms; price of anarchy; prior-free auctions; selfish routing; sponsored search. Prerequisites: 154N and 161, or equivalents.
Last offered: Autumn 2013
Filter Results:
term offered
updating results...
teaching presence
updating results...
number of units
updating results...
time offered
updating results...
days
updating results...
UG Requirements (GERs)
updating results...
component
updating results...
career
updating results...
© Stanford University | Terms of Use | Copyright Complaints