Lecture

EPFL IC Faculty Overview

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Description

This lecture provides an overview of the EPFL School of Computer and Communication Sciences, highlighting its internationally recognized faculty, strong industrial partnerships, and top rankings in various research areas. It covers the different research groups within the IC faculty, such as Graphics & Vision, Artificial Intelligence, Algorithms, and Systems, emphasizing the interdisciplinary nature of the research conducted. The lecture also delves into the EDIC program structure, including depth and breadth requirements, semester projects, and the path to a PhD, offering valuable insights for prospective students.

Official source

Related concepts (32)

Computer science

Computer science is the study of computation, information, and automation. Computer science spans theoretical disciplines (such as algorithms, theory of computation, and information theory) to applied disciplines (including the design and implementation of hardware and software). Though more often considered an academic discipline, computer science is closely related to computer programming. Algorithms and data structures are central to computer science.

Computer science and engineering

Computer science and engineering (CSE) is an academic program at many universities which comprises scientific and engineering aspects of computing. CSE is also a term often used in Europe to translate the name of engineering informatics academic programs. It is offered in both undergraduate as well postgraduate with specializations. Academic programs vary between colleges, but typically include a combination of topics in computer science, computer engineering, and electrical engineering.

Theoretical computer science

Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on mathematical aspects of computer science such as the theory of computation, lambda calculus, and type theory. It is difficult to circumscribe the theoretical areas precisely. The ACM's Special Interest Group on Algorithms and Computation Theory (SIGACT) provides the following description: History of computer science While logical inference and mathematical proof had existed previously, in 1931 Kurt Gödel proved with his incompleteness theorem that there are fundamental limitations on what statements could be proved or disproved.

Information theory

Information theory is the mathematical study of the quantification, storage, and communication of information. The field was originally established by the works of Harry Nyquist and Ralph Hartley, in the 1920s, and Claude Shannon in the 1940s. The field, in applied mathematics, is at the intersection of probability theory, statistics, computer science, statistical mechanics, information engineering, and electrical engineering. A key measure in information theory is entropy.

Algorithm

In mathematics and computer science, an algorithm (ˈælɡərɪðəm) is a finite sequence of rigorous instructions, typically used to solve a class of specific problems or to perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can use conditionals to divert the code execution through various routes (referred to as automated decision-making) and deduce valid inferences (referred to as automated reasoning), achieving automation eventually.

Related lectures (64)

Entropy and Algorithms: Applications in Sorting and Weighing

Covers the application of entropy in algorithms, focusing on sorting and decision-making strategies.

EPFL Computer Science Overview

Covers EPFL's Computer Science School, faculty expertise, EDIC program requirements, and post-PhD career paths.

Differentiable Ranking and Sorting

Explores differentiable ranking and sorting techniques for machine learning applications.

Machine Learning Theory: High-Dimensional Perspectives

Explores high-dimensional perspectives in machine learning theory, shedding light on new insights and challenges.

Introduction: Course Structure and Fundamentals of Computing