CS 369A: Advanced Geometric Algorithms
Approximate, randomized, and high-dimensional geometric algorithms. Topics of current interest: clustering; nearest-neighbor search; shortest paths; geometric random walks; shape fitting; geometric embeddings; coresets; geometric TSP; and linear programming. Prerequisites: 368 or equivalent.
| Repeatable
1 times
(up to 3 units total)
CS 369F: Topics in Analysis of Algorithms
Focus is on combinatorial optimization with emphasis on online algorithms.
| Repeatable
1 times
(up to 3 units total)
CS 369P: Polyhedral Techyniques in Combinatorial Optimization
Graduate-level course in combinatorial optimization with a focus on polyhedral characterizations. First part of the course covers some classical results in combinatorial optimization: algorithms and polyhedral characterizations for matchings, spanning trees, matroids, and submodular functions. Second part covers some more recent work that builds upon these techniques-approximation algorithms using the primal-dual scheme, iterated rounding and dependent randomized rounding. Applications will include allocation in combinatorial auctions, network design, and variants of the traveling salesman problem.
CS 377W: Create Engaging Web Applications Using Metrics and Learning on Facebook
Experimental course. Students work in small, interdisciplinary teams to create, launch, and optimize web-based applications for social networks such as Facebook. Tools include Google Analytics. Online experiments and user responses to learn how to iterate and improve applications. Guest experts.
CS 379D: Computer Vision and Image Analysis in the Study of Art
Application of algorithms to computer vision, image analysis, and two-dimensional Western art such as paintings, drawings, and etchings. Topics: multispectral image enhancement and color manipulation; geometric perspective and warped (anamorphic) perspective; visual metrology; view synthesis; statistical analysis of form; texture and brushstrokes; and shape-from-shading. These techniques, pattern classification, statistical estimation methods, and stylometry (quantification of artistic style) address art historical problems such as attribution, authentication, and dating to reveal artists¿ working methods.
CS 447: Software Design Experiences
Small teams develop technology prototypes combining product and interaction design. Focus is on software and hardware interfaces, interaction, design aesthetics, and underpinnings of successful design including a reflective, interactive design process, group dynamics of interdisciplinary teamwork, and working with users. Prerequisite:
CS 247A.
CS 448: Topics in Computer Graphics
Topic changes each quarter. Recent topics: computational photography, datannvisualization, character animation, virtual worlds, graphics architectures, advanced rendering. See
http://graphics.stanford.edu/courses for offererings and prerequisites. May be repeated for credit.
| Repeatable
for credit
CS 448F: Image Processing for Photography and Vision
Image processing with a focus on implementation of new techniques from the literature. Topics: sampling and reconstruction, linear and non-linear filters, features and alignment, compositing, gradient-domain techniques, and recent techniques from conferences such as SIGGRAPH and Eurographics. Prerequisites: Students should be comfortable coding in C++. An introductory graphics course such as CS148 is helpful but not necessary.
CS 450: Introduction to Biotechnology
Academic and industrial experts discuss latest developments in fields such as bioenergy, green process technology, the production of industrial chemicals from renewable resources, protein pharmaceutical production, industrial enzyme production, stem cell applications, medical diagnostics, and medical imaging. Discussions of biotechnology ethics, business and patenting issues, and entrepreneurship in biotechnology.
CS 548: Internet and Distributed Systems Seminar
Guest speakers from academia and industry. May be repeated for credit.
| Repeatable
for credit
Filter Results: