No description available.

The course is concerned with approximate geometric methods for the analysis of large data sets represented by point clouds. Concrete topics areLow Distortion Embedding, Approximate Nearest Neighbor Search, Semi Definite Programming, Approximations and Nets, Approximate Smallest Enclosing Balls and Boxes, Directional Width, Support Vector Machines.

The course covers the fundamental concepts of computer programming and gives a short overview of object oriented program design.Specific topics include: computers, programming languages and compilers, data types, type conversion, expressions, language constructs, arrays, pointers, references, functions, scope, modular programming, files, classes, inheritance, polymorphism

Introduction to basic problem solving methods, algorithms, and data structures. Topics: divide and conquer, recursion, sorting algorithms, backtracking, game tree search, data structures (lists, stacks, queues, binary trees), discrete simulation, concurrency. In the assignments and exercises, the programming language Java is used.

Presentation of recent publications in theoretical computer science, including results by diploma, masters and doctoral candidates.