2013-2014 2014-2015 2015-2016 2016-2017 2017-2018
Browse
by subject...
    Schedule
view...
 

1 - 4 of 4 results for: CS103

CS 103: Mathematical Foundations of Computing

Mathematical foundations required for computer science, including propositional predicate logic, induction, sets, functions, and relations. Formal language theory, including regular expressions, grammars, finite automata, Turing machines, and NP-completeness. Mathematical rigor, proof techniques, and applications. Prerequisite: 106A or equivalent.
Terms: Aut, Win | Units: 3-5 | UG Reqs: GER:DB-Math, WAY-FR | Grading: Letter or Credit/No Credit

CS 124: From Languages to Information (LINGUIST 180, LINGUIST 280)

Extracting meaning, information, and structure from human language text, speech, web pages, genome sequences, social networks, or any less structured information. Methods include: string algorithms, edit distance, language modeling, naive Bayes, inverted indices, vector semantics. Applications such as question answering, sentiment analysis, information retrevial, text classification, social network models, machine translation, genomic sequence alignment, spell checking, speech processing. Prerequisite: CS103, CS107, CS109.
Terms: Win | Units: 3-4 | Grading: Letter or Credit/No Credit
Instructors: Jurafsky, D. (PI)

LINGUIST 180: From Languages to Information (CS 124, LINGUIST 280)

Extracting meaning, information, and structure from human language text, speech, web pages, genome sequences, social networks, or any less structured information. Methods include: string algorithms, edit distance, language modeling, naive Bayes, inverted indices, vector semantics. Applications such as question answering, sentiment analysis, information retrevial, text classification, social network models, machine translation, genomic sequence alignment, spell checking, speech processing. Prerequisite: CS103, CS107, CS109.
Terms: Win | Units: 3-4 | Grading: Letter or Credit/No Credit
Instructors: Jurafsky, D. (PI)

LINGUIST 280: From Languages to Information (CS 124, LINGUIST 180)

Extracting meaning, information, and structure from human language text, speech, web pages, genome sequences, social networks, or any less structured information. Methods include: string algorithms, edit distance, language modeling, naive Bayes, inverted indices, vector semantics. Applications such as question answering, sentiment analysis, information retrevial, text classification, social network models, machine translation, genomic sequence alignment, spell checking, speech processing. Prerequisite: CS103, CS107, CS109.
Terms: Win | Units: 3-4 | Grading: Letter or Credit/No Credit
Instructors: Jurafsky, D. (PI)
Filter Results:
term offered
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