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

2231 - 2240 of 9648 results for: ...

CS 339: Topics in Numerical Analysis

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 2003 | Repeatable for credit

CS 343: Advanced Topics in Compilers

Topics change every year. May be repeated for credit. Prerequisite: 243.
Terms: Spr | Units: 3 | Repeatable for credit
Instructors: Engler, D. (PI)

CS 345A: Data Mining

Algorithms for mining large-scale data, including data from the web and data maintained by web-based enterprises. Finding frequent itemsets; finding similar sets using minhashing, locality-sensitive hashing, and index-based methods; finding important web pages by PageRank; link-spam detection; collaborative filtering; stream mining; clustering; optimizing ad selection; virtual databases and extraction of relations from the web.
Terms: Win | Units: 3

CS 346: Database System Implementation

A major database system implementation project realizes the principles and techniques covered in earlier courses. Students independently build a complete database management system, from file structures through query processing, with a personally designed feature or extension. Lectures on project details and advanced techniques in database system implementation, focusing on query processing and optimization. Guest speakers from industry on commercial DBMS implementation techniques. Prerequisites: 145, 245, programming experience in C++.
Terms: Spr | Units: 3-5

CS 347: Transaction Processing and Distributed Databases

The principles and system organization of distributed databases. Data fragmentation and distribution, distributed database design, query processing and optimization, distributed concurrency control, reliability and commit protocols, and replicated data management. Distributed algorithms for data management: clocks, deadlock detection, and mutual exclusion. Heterogeneous and federated distributed database systems. Overview of commercial systems and research prototypes. Prerequisites: 145, 245.
Terms: Spr | Units: 3

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, Bezier arcs and de Casteljau subdivision, continuity constraints, B-splines, tensor product, and triangular patch surfaces. Subdivision surfaces and multiresolution representations of geometry. Representations of solids and conversions among them. Surface reconstruction from scattered data points. Geometry processing on meshes, including simplification. Prerequisite: linear algebra. Recommended: 164.
Terms: Aut | Units: 3-4
Instructors: Guibas, L. (PI)

CS 348B: Computer Graphics: Image Synthesis Techniques

Intermediate level, emphasizing the sampling, shading, and display aspects of computer graphics. Topics: local and global illumination methods including radiosity and distributed ray tracing, texture generation and rendering, volume rendering, strategies for anti-aliasing and photo-realism, human vision and color science as they relate to computer displays, and high-performance architectures for graphics. Written assignments and programming projects. Prerequisite: 248 or equivalent. Recommended: Fourier analysis or digital signal processing.
Terms: Spr | Units: 3-4
Instructors: Hanrahan, P. (PI)

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.
Terms: Aut, Win | Units: 1-3

CS 355: Advanced Topics in Cryptography

Topics: pseudo-random generation, zero knowledge protocols, elliptic curve systems, threshold cryptography, security analysis using random oracles, lower and upper bounds on factoring and discrete log. May be repeated for credit. Prerequisite: 255.
Terms: Spr | Units: 3 | Repeatable for credit
Instructors: Boneh, D. (PI)
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