printer friendly pageCS 315B: Parallel Computing Research Project
Advanced topics and new paradigms in parallel computing including parallel algorithms, programming languages, runtime environments, library debugging/tuning tools, and scalable architectures. Research project. Prerequisite: consent of instructor.
CS 344: Topics in Computer Networks
High-performance embedded system design. Student teams of two software engineers (C experience required) and one hardward engineer (Verilog experience required) build a fully functioning Internet router Work in teams of three. How router interoperates with others in class. Open-ended design challenge judged by panel of industry experts. Prerequisites:
CS 144, 244, or network programming experience.
CS 344E: Advanced Wireless Networks
Networking research in wireless systems. Topics include: multi-channel/multi-radio systems, routing, coding, physical layer hints, low power, mesh networking, interference cancellation, technological trends, and protocol design. Students implement and test research ideas on SWAN, a WiFi testbed.
| Repeatable
1 times
(up to 3 units total)
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.
Instructors:
Pharr, M. (PI)
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.
CS 361A: Advanced Algorithms
Advanced data structures: union-find, self-adjusting data structures and amortized analysis, dynamic trees, Fibonacci heaps, universal hash function and sparse hash tables, persistent data structures. Advanced combinatorial algorithms: algebraic (matrix and polynomial) algorithms, number theoretic algorithms, group theoretic algorithms and graph isomorphism, online algorithms and competitive analysis, strings and pattern matching, heuristic and probabilistic analysis (TSP, satisfiability, cliques, colorings), local search algorithms. May be repeated for credit. Prerequisite: 161 or 261, or equivalent.
| Repeatable
for credit
CS 369N: Beyond Worst-Case Analysis
Analysis of algorithms and problems for which worst-case complexity in uninformative. Topics include: instance optimality; smoothed analysis; parameterized analysis and condition numbers; models of data (pseudorandomness, locality, diffuse adversaries, etc.); average-case analysis; robust distributional analysis; resource augmentation; planted and semi-random graph models. Motivating problems drawn from online algorithms, online learning, constraint satisfaction problems, graph partitioning, scheduling, linear programming, hashing, and auction theory.
CS 377L: Learning in a Networked World: Learning Analytics in Technology-Enhanced Education (EDUC 298)
Foundations, theories and empirical studies for interdisciplinary advances in how we conceive of the potentials and challenges associated with lifelong, lifewide and life-deep learning in a networked world given the growth of always-on cyberinfrastructure for supporting information and social networks across space and time with personal computers, netbooks, and mobiles.
CS 379L: Designing Liberation Technology (POLISCI 337T)
Small project teams work with NGOs to design new technologies for promoting development and democracy. Students conduct observations to identify needs, generate concepts, create prototypes, and test their appropriateness. Some projects may continue past the quarter toward full-scale implementation. Taught through the Hasso Plattner Institute of Design at Stanfordn(
http://dschool.stanford.edu). Enrollment limited. Application required. Prerequisites: consent of instructor(s). Design Institute class; see
http://dschool.stanford.edu.
Instructors:
Winograd, T. (PI)
CS 402: Beyond Bits and Atoms: Designing Technological Tools (EDUC 236X)
Practicum in designing and building technology-enabled curricula and learning environments. Students use software toolkits and state-of-the-art fabrication machines to design educational software, educational toolkits, and tangible user interfaces. How to design low-cost technologies, particularly for urban school in the US and abroad. The constructionist learning design perspective, critical pedagogy, and the application of complexity sciences in education.
Filter Results: