printer friendly pageANTHRO 109A: Archaeology of the Modern World (ANTHRO 209A, ARCHLGY 109A)
Historical archaeology, also called the archaeology of the modern world, investigates the material culture and spatial history of the past five centures. As a discipline, historical archaeology has been characterized by (1) a methodological conjunction between history and archaeology; (2) a topical focus on the ¿three Cs¿: colonization, captivity, and capitalism ¿ forces which arguably are constitutive of the modern world; and (3) an epistemological priority to recovering the perspectives of ¿people without history.¿ Each of these three trends is widely debated yet they continue to profoundly shape the field. This seminar provides an in-depth examination of the emergence and development of this historical archaeology, with a focus on current issues in theory and method. For undergraduates, the prerequisite is
Anthro 3 or consent of instructor.
Last offered: Autumn 2017
| UG Reqs: WAY-EDP, WAY-SI
BIODS 237: Deep Learning in Genomics and Biomedicine (BIOMEDIN 273B, CS 273B, GENE 236)
Recent breakthroughs in high-throughput genomic and biomedical data are transforming biological sciences into "big data" disciplines. In parallel, progress in deep neural networks are revolutionizing fields such as image recognition, natural language processing and, more broadly, AI. This course explores the exciting intersection between these two advances. The course will start with an introduction to deep learning and overview the relevant background in genomics and high-throughput biotechnology, focusing on the available data and their relevance. It will then cover the ongoing developments in deep learning (supervised, unsupervised and generative models) with the focus on the applications of these methods to biomedical data, which are beginning to produced dramatic results. In addition to predictive modeling, the course emphasizes how to visualize and extract interpretable, biological insights from such models. Recent papers from the literature will be presented and discussed. Students will be introduced to and work with popular deep learning software frameworks. Students will work in groups on a final class project using real world datasets. Prerequisites: College calculus, linear algebra, basic probability and statistics such as
CS 109, and basic machine learning such as
CS 229. No prior knowledge of genomics is necessary.
Terms: Aut
| Units: 3
BIOMEDIN 273B: Deep Learning in Genomics and Biomedicine (BIODS 237, CS 273B, GENE 236)
Recent breakthroughs in high-throughput genomic and biomedical data are transforming biological sciences into "big data" disciplines. In parallel, progress in deep neural networks are revolutionizing fields such as image recognition, natural language processing and, more broadly, AI. This course explores the exciting intersection between these two advances. The course will start with an introduction to deep learning and overview the relevant background in genomics and high-throughput biotechnology, focusing on the available data and their relevance. It will then cover the ongoing developments in deep learning (supervised, unsupervised and generative models) with the focus on the applications of these methods to biomedical data, which are beginning to produced dramatic results. In addition to predictive modeling, the course emphasizes how to visualize and extract interpretable, biological insights from such models. Recent papers from the literature will be presented and discussed. Students will be introduced to and work with popular deep learning software frameworks. Students will work in groups on a final class project using real world datasets. Prerequisites: College calculus, linear algebra, basic probability and statistics such as
CS 109, and basic machine learning such as
CS 229. No prior knowledge of genomics is necessary.
Terms: Aut
| Units: 3
CS 109: Introduction to Probability for Computer Scientists
Topics include: counting and combinatorics, random variables, conditional probability, independence, distributions, expectation, point estimation, and limit theorems. Applications of probability in computer science including machine learning and the use of probability in the analysis of algorithms. Prerequisites: 103, 106B or X, multivariate calculus at the level of
MATH 51 or
CME 100 or equivalent.
Terms: Aut, Spr, Sum
| Units: 3-5
| UG Reqs: WAY-AQR, WAY-FR, GER:DB-EngrAppSci
Instructors:
Arthurs, N. (PI)
;
Piech, C. (PI)
;
Arthurs, N. (TA)
;
Banerjee, O. (TA)
;
Barbier, N. (TA)
;
Birnbaum, S. (TA)
;
Blanc, G. (TA)
;
Bowman, N. (TA)
;
Braun, B. (TA)
;
Casares Rosa, B. (TA)
;
Chen, J. (TA)
;
Cruz-Albrecht, L. (TA)
;
Daniel, J. (TA)
;
Dass, N. (TA)
;
El-Yabroudi, N. (TA)
;
Gruver, N. (TA)
;
Hu, A. (TA)
;
Istrate, A. (TA)
;
Liang, D. (TA)
;
Raterink, C. (TA)
;
Redondo, E. (TA)
;
Rusak, G. (TA)
;
Schwager, S. (TA)
;
Smith, C. (TA)
;
Tsun, A. (TA)
;
Vu, A. (TA)
CS 161: Design and Analysis of Algorithms
Worst and average case analysis. Recurrences and asymptotics. Efficient algorithms for sorting, searching, and selection. Data structures: binary search trees, heaps, hash tables. Algorithm design techniques: divide-and-conquer, dynamic programming, greedy algorithms, amortized analysis, randomization. Algorithms for fundamental graph problems: minimum-cost spanning tree, connected components, topological sort, and shortest paths. Possible additional topics: network flow, string searching. Prerequisite: 103 or 103B; 109 or
STATS 116.
Terms: Aut, Win, Sum
| Units: 3-5
| UG Reqs: GER:DB-EngrAppSci, WAY-FR
Instructors:
Hulett, R. (PI)
;
Rubinstein, A. (PI)
;
Silas, S. (PI)
...
more instructors for CS 161 »
Instructors:
Hulett, R. (PI)
;
Rubinstein, A. (PI)
;
Silas, S. (PI)
;
Wootters, M. (PI)
;
Ali Mohammadi, Y. (TA)
;
Baby, S. (TA)
;
Baby, S. (TA)
;
Blanc, G. (TA)
;
Chen, J. (TA)
;
Deaton, J. (TA)
;
Effron, A. (TA)
;
Fosli, I. (TA)
;
Glaser, N. (TA)
;
Guo, N. (TA)
;
Gupta, A. (TA)
;
Hosgur, E. (TA)
;
Hulett, R. (TA)
;
Ibeling, D. (TA)
;
Jhunjhunwala, M. (TA)
;
Li, H. (TA)
;
Mu, R. (TA)
;
Murphy, D. (TA)
;
Narayanan, D. (TA)
;
Navarro, J. (TA)
;
Redondo, E. (TA)
;
Shi, A. (TA)
;
Silas, S. (TA)
;
Starosta, A. (TA)
;
Voisin, M. (TA)
;
Zhang, B. (TA)
;
Zhu, A. (TA)
CS 210A: Software Project Experience with Corporate Partners
Two-quarter project course. Focus is on real-world software development. Corporate partners seed projects with loosely defined challenges from their R&D labs; students innovate to build their own compelling software solutions. Student teams are treated as start-up companies with a budget and a technical advisory board comprised of instructional staff and corporate liaisons. Teams will typically travel to the corporate headquarters of their collaborating partner, meaning some teams will travel internationally. Open loft classroom format such as found in Silicon Valley software companies. Exposure to: current practices in software engineering; techniques for stimulating innovation; significant development experience with creative freedoms; working in groups; real-world software engineering challenges; public presentation of technical work; creating written descriptions of technical work. Prerequisites:
CS 109 and 110.
Terms: Win
| Units: 3-4
CS 221: Artificial Intelligence: Principles and Techniques
Artificial intelligence (AI) has had a huge impact in many areas, including medical diagnosis, speech recognition, robotics, web search, advertising, and scheduling. This course focuses on the foundational concepts that drive these applications. In short, AI is the mathematics of making good decisions given incomplete information (hence the need for probability) and limited computation (hence the need for algorithms). Specific topics include search, constraint satisfaction, game playing, Markov decision processes, graphical models, machine learning, and logic. Prerequisites:
CS 103 or
CS 103B/X,
CS 106B or
CS 106X,
CS 107, and
CS 109 (algorithms, probability, and programming experience).
Terms: Aut, Spr, Sum
| Units: 3-4
Instructors:
Charikar, M. (PI)
;
Jia, R. (PI)
;
Liang, P. (PI)
;
Sadigh, D. (PI)
;
Amidi, S. (TA)
;
Baby, S. (TA)
;
Bakst, W. (TA)
;
Balachandar, N. (TA)
;
Barbier, N. (TA)
;
Chen, J. (TA)
;
Dhoot, A. (TA)
;
Diamond, S. (TA)
;
Diehl Martinez, R. (TA)
;
Dong, S. (TA)
;
Effron, A. (TA)
;
Fu, A. (TA)
;
Golub, D. (TA)
;
Gupta, A. (TA)
;
Han, A. (TA)
;
Hoffman, J. (TA)
;
Hsu, V. (TA)
;
Kabaghe, C. (TA)
;
Kamath, A. (TA)
;
Laloudakis, Y. (TA)
;
Lee, J. (TA)
;
Li, Y. (TA)
;
Liu, K. (TA)
;
Mani, N. (TA)
;
Patel, V. (TA)
;
Petit, B. (TA)
;
Qin, Z. (TA)
;
Saleh, M. (TA)
;
Selsam, D. (TA)
;
Seshadri, S. (TA)
;
Shah, C. (TA)
;
Sohmshetty, A. (TA)
;
Sriram, P. (TA)
;
Srivastava, M. (TA)
;
Wang, H. (TA)
;
Wang, Z. (TA)
;
Wu, Y. (TA)
;
Zhou, B. (TA)
;
Zhu, A. (TA)
CS 252: Analysis of Boolean Functions
Boolean functions are among the most basic objects of study in theoretical computer science. This course is about the study of boolean functions from a complexity-theoretic perspective, with an emphasis on analytic methods. We will cover fundamental concepts and techniques in this area, including influence and noise sensitivity, polynomial approximation, hypercontractivity, probabilistic invariance principles, and Gaussian analysis. We will see connections to various areas of theoretical computer science, including circuit complexity, pseudorandomness, classical and quantum query complexity, learning theory, and property testing. Prerequisites:
CS 103 and
CS 109 or equivalents.
CS 154 and
CS 161 recommended.
Terms: Aut
| Units: 3
Instructors:
Tan, L. (PI)
CS 273B: Deep Learning in Genomics and Biomedicine (BIODS 237, BIOMEDIN 273B, GENE 236)
Recent breakthroughs in high-throughput genomic and biomedical data are transforming biological sciences into "big data" disciplines. In parallel, progress in deep neural networks are revolutionizing fields such as image recognition, natural language processing and, more broadly, AI. This course explores the exciting intersection between these two advances. The course will start with an introduction to deep learning and overview the relevant background in genomics and high-throughput biotechnology, focusing on the available data and their relevance. It will then cover the ongoing developments in deep learning (supervised, unsupervised and generative models) with the focus on the applications of these methods to biomedical data, which are beginning to produced dramatic results. In addition to predictive modeling, the course emphasizes how to visualize and extract interpretable, biological insights from such models. Recent papers from the literature will be presented and discussed. Students will be introduced to and work with popular deep learning software frameworks. Students will work in groups on a final class project using real world datasets. Prerequisites: College calculus, linear algebra, basic probability and statistics such as
CS 109, and basic machine learning such as
CS 229. No prior knowledge of genomics is necessary.
Terms: Aut
| Units: 3
CS 276: Information Retrieval and Web Search (LINGUIST 286)
Text information retrieval systems; efficient text indexing; Boolean, vector space, and probabilistic retrieval models; ranking and rank aggregation; evaluating IR systems; text clustering and classification; Web search engines including crawling and indexing, link-based algorithms, web metadata, and question answering; distributed word representations. Prerequisites:
CS 107,
CS 109,
CS 161.
Terms: Spr
| Units: 3
Instructors:
Manning, C. (PI)
;
Nayak, P. (PI)
;
Chute, C. (TA)
;
Jia, F. (TA)
;
Paranjape, A. (TA)
;
Sampath, R. (TA)
Filter Results: