# Search result: Catalogue data in Spring Semester 2015

Computer Science Master | ||||||

Focus Courses | ||||||

Focus Courses in Visual Computing | ||||||

Seminar in Visual Computing | ||||||

Number | Title | Type | ECTS | Hours | Lecturers | |
---|---|---|---|---|---|---|

252-5704-00L | Advanced Methods in Computer Graphics Number of participants limited to 24. | W | 2 credits | 2S | M. Gross, O. Sorkine Hornung | |

Abstract | This seminar covers advanced topics in computer graphics with a focus on the latest research results. Topics include modeling, rendering, animation, physical simulation, computational photography, and others. | |||||

Objective | The goal is to obtain an in-depth understanding of actual problems and research topics in the field of computer graphics as well as improve presentation and critical analysis skills. | |||||

Computer Science Elective Courses The Elective Computer Science Courses can be selected from all Master level courses offered by D-INFK. | ||||||

Number | Title | Type | ECTS | Hours | Lecturers | |

252-0820-00L | Case Studies from Practice | W | 4 credits | 2V + 1U | M. Brandis | |

Abstract | The course is designed to provide students with an understanding of "real-life" challenges from business settings and teach them how to address these. | |||||

Objective | By using case studies that are based on actual IT projects, students will learn how to deal with complex, not straightforward problems. It will help them to apply their theoretical Computer Science background in practice and will teach them fundamental principles of IT management and challenges with IT in practice. | |||||

Content | The course consists of multiple lectures about general IT management topics held by Marc Brandis and case studies provided by guest lecturers from either IT companies or IT departments of a diverse range of companies. Presenting companies so far include Deloitte (how to develop innovative technology solutions for a luxury retailer), Selfnation (lessons learned from a startup company), Credit Suisse (investment banking case), HP (business continuity management), 28msec (product pricing in a software startup company), Open Web Technology (strategic choices in software development), and Marc Brandis Strategic Consulting (various). | |||||

263-0600-00L | Research in Computer Science Only for Computer Science MSc. | W | 5 credits | 11A | Professors | |

Abstract | Independent project work under the supervision of a Computer Science Professor. | |||||

Objective | see above | |||||

Prerequisites / Notice | Only students who fulfill one of the following requirements are allowed to begin a research project: a) 1 lab (interfocus course) and 1 core focus course b) 2 core focus courses c) 2 labs (interfocus courses) A task description must be submitted to the Student Administration Office at the beginning of the work. | |||||

272-0300-00L | Algorithmics for Hard Problems This course d o e s n o t include the Mentored Work Specialised Courses with an Educational Focus in Computer Science A. | W | 4 credits | 2V + 1U | J. Hromkovic, H.‑J. Böckenhauer, D. Komm | |

Abstract | This course unit looks into algorithmic approaches to the solving of hard problems. The seminar is accompanied by a comprehensive reflection upon the significance of the approaches presented for computer science tuition at high schools. | |||||

Objective | To systematically acquire an overview of the methods for solving hard problems. | |||||

Content | First, the concept of hardness of computation is introduced (repeated for the computer science students). Then some methods for solving hard problems are treated in a systematic way. For each algorithm design method, it is discussed what guarantees it can give and how we pay for the improved efficiency. | |||||

Lecture notes | Unterlagen und Folien werden zur Verfügung gestellt. | |||||

Literature | J. Hromkovic: Algorithmics for Hard Problems, Springer 2004. R. Niedermeier: Invitation to Fixed-Parameter Algorithms, 2006. F. Fomin, D. Kratsch: Exact Exponential Algorithms, 2010. | |||||

272-0302-00L | Approximation and Online Algorithms | W | 4 credits | 2V + 1U | H.‑J. Böckenhauer, D. Komm | |

Abstract | This lecture deals with approximative algorithms for hard optimization problems and algorithmic approaches for solving online problems as well as the limits of these approaches. | |||||

Objective | Get a systematic overview of different methods for designing approximative algorithms for hard optimization problems and online problems. Get to know methods for showing the limitations of these approaches. | |||||

Content | Approximation algorithms are one of the most succesful techniques to attack hard optimization problems. Here, we study the so-called approximation ratio, i.e., the ratio of the cost of the computed approximating solution and an optimal one (which is not computable efficiently). For an online problem, the whole instance is not known in advance, but it arrives pieceweise and for every such piece a corresponding part of the definite output must be given. The quality of an algorithm for such an online problem is measured by the competitive ratio, i.e., the ratio of the cost of the computed solution and the cost of an optimal solution that could be given if the whole input was known in advance. The contents of this lecture are - the classification of optimization problems by the reachable approximation ratio, - systematic methods to design approximation algorithms (e.g., greedy strategies, dynamic programming, linear programming relaxation), - methods to show non-approximability, - classic online problem like paging or scheduling problems and corresponding algorithms, - randomized online algorithms, - the design and analysis principles for online algorithms, and - limits of the competitive ratio and the advice complexity as a way to do a deeper analysis of the complexity of online problems. | |||||

Literature | Die Vorlesung orientiert sich teilweise an folgenden Büchern: J. Hromkovic: Algorithmics for Hard Problems, Springer, 2004 A. Borodin, R. El-Yaniv: Online Computation and Competitive Analysis, Cambridge University Press, 1998 D. Komm: Advice and Randomization in Online Computation, 2012 | |||||

401-3632-00L | Computational Statistics | W | 10 credits | 3V + 2U | M. Mächler, P. L. Bühlmann | |

Abstract | "Computational Statistics" deals with modern methods of data analysis (aka "data science") for prediction and inference. An overview of existing methodology is provided and also by the exercises, the student is taught to choose among possible models and about their algorithms and to validate them using graphical methods and simulation based approaches. | |||||

Objective | Getting to know modern methods of data analysis for prediction and inference. Learn to choose among possible models and about their algorithms. Validate them using graphical methods and simulation based approaches. | |||||

Content | Course Synopsis: multiple regression, nonparametric methods for regression and classification (kernel estimates, smoothing splines, regression and classification trees, additive models, projection pursuit, neural nets, ridging and the lasso, boosting). Problems of interpretation, reliable prediction and the curse of dimensionality are dealt with using resampling, bootstrap and cross validation. Details are available via http://stat.ethz.ch/education/ . Exercises will be based on the open-source statistics software R (http://www.R-project.org/). Emphasis will be put on applied problems. Active participation in the exercises is strongly recommended. More details are available via the webpage http://stat.ethz.ch/education/ (-> "Computational Statistics"). | |||||

Lecture notes | lecture notes are available online; see http://stat.ethz.ch/education/ (-> "Computational Statistics"). | |||||

Literature | (see the link above, and the lecture notes) | |||||

Prerequisites / Notice | Basic "applied" mathematical calculus and linear algebra. At least one semester of (basic) probability and statistics. | |||||

272-0301-00L | Methods for Design of Random Systems Does not take place this semester. This course d o e s n o t include the Mentored Work Specialised Courses with an Educational Focus in Computer Science B. | W | 4 credits | 2V + 1U | J. Hromkovic | |

Abstract | The students should get a deep understanding of the notion of randomness and its usefulness. Using basic elements probability theory and number theory the students will discover randomness as a source of efficiency in algorithmic. The goal is to teach the paradigms of design of randomized algorithms. | |||||

Objective | To understand the computational power of randomness and to learn the basic methods for designing randomized algorithms | |||||

Lecture notes | J. Hromkovic: Randomisierte Algorithmen, Teubner 2004. J.Hromkovic: Design and Analysis of Randomized Algorithms. Springer 2006. J.Hromkovic: Algorithmics for Hard Problems, Springer 2004. | |||||

Literature | J. Hromkovic: Randomisierte Algorithmen, Teubner 2004. J.Hromkovic: Design and Analysis of Randomized Algorithms. Springer 2006. J.Hromkovic: Algorithmics for Hard Problems, Springer 2004. | |||||

Elective Courses Students can individually chose from the entire Master course offerings from ETH Zurich, EPF Lausanne, the University of Zurich and - but only with the consent of the Director of Studies - from all other Swiss universities. For further details please see Art. 31 of the Regulations 2009 for the Master Program in Computer Science. | ||||||

Internship | ||||||

Number | Title | Type | ECTS | Hours | Lecturers | |

252-0700-00L | Internship Only for Computer Science MSc. | W | 0 credits | external organisers | ||

Abstract | Internship in a computer science company, which is admitted by the CS Department at ETH. Minimum 10 weeks fulltime employment. | |||||

Objective | The main objective of the 10-week internship is to expose students to the industrial work environment. During this period, students have the opportunity to be involved in on-going projects at the host institution. | |||||

Prerequisites / Notice | A task description must be presented for approval, before the start of the internship. After completion of the internship, a work certificate must be presented. | |||||

Compulsory Electives in Humanities, Social and Political Sciences | ||||||

» see GESS Compulsory Electives | ||||||

Master Thesis | ||||||

Number | Title | Type | ECTS | Hours | Lecturers | |

263-0800-00L | Master's Thesis Only students who fulfill the following criteria are allowed to begin with their master thesis: a. successful completion of the bachelor programme; b. fulfilling any additional requirements necessary to gain admission to the master programme; c. "Inter focus courses" (12 credits) completed; d. "Focus courses" (26 credits) completed. | O | 30 credits | 64D | Professors | |

Abstract | Independent project work supervised by a Computer Science professor. Duration 6 months. | |||||

Objective | To work independently and to produce a scientifically structured work under the supervision of a Computer Science Professor. |

- Page 4 of 4 All