• Keine Ergebnisse gefunden

General Information

N/A
N/A
Protected

Academic year: 2022

Aktie "General Information"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Department of Mathematics and Computer Science

10907-01 Pattern Recognition Fall 2019

https://dmi.unibas.ch/de/studium/computer-science-informatik/lehrangebot-hs19/lecture-pattern-recognition/

Lecturers Assistants

Prof. Dr. Thomas Vetter <thomas.vetter@unibas.ch> Dennis Madsen <dennis.madsen@unibas.ch>

Dana Rahbani <dana.rahbani@unibas.ch>

Moira Zuber <moira.zuber@unibas.ch>

Genia Böing. <genia.boeing@unibas.ch>

General Information

Administrative

• You need to register at https://services.unibas.ch

• Passing the final oral exam is necessary to earn credit points

• Passing the exercises is necessary to be admitted to the final exam

• You pass the exercises if you earn a minimum of 40/60 of the exercise points (maximum 10 points/exercise and a total of 6 exercises)

Exercises

• The exercises are mainly practical programming problems. You should solve them together with partners in groups of three students. The solutions are presented orally, each student can be graded individually (15 min). We score your answer to our questions not your code. Questions are about conceptual understanding as well as results and difficulties of the code. Visiting the presentation sessions is mandatory to earn points.

• Exercises are due every two weeks. The week in-between, we will discuss the previous exercises and also answer your questions and discuss problems. Visiting the discussion sessions is not mandatory but recommended. It takes place on Monday 14 – 16, marked with “(S)” in the exercise schedule.

• The official programming language is Python.

• The 15 minutes presentation time are not to discuss syntax or run-time difficulties. Please appear fully prepared. If you experience troubles contact us early and visit the exercise discussions (marked with

“(S)” in the schedule).

If plagiarism is observed, this will result in a grade of 0 points for the affected exercise to all involved partners who submitted the same exercise (we will also be comparing your work to previous years' exercises). If plagiarism is detected in any other subsequent exercises, the student will be excluded from going to the exam. See the University guidelines for plagiarism:

https://dmi.unibas.ch/fileadmin/user_upload/dmi/Studium/Computer_Science/Diverses/Guidelines_for_the_Dealing_with_Plagiarism.pdf

Questions are mainly to be answered in the Monday timeslot, but if you should still have questions or troubles, feel free to ask us:

• Dennis Madsen, dennis.madsen@unibas.ch, office 01.001, Spiegelgasse 1

• Dana Rahbani, dana.rahbani@unibas.ch, office 01.001, Spiegelgasse 1 Enjoy the exercises, you will be creating your own pattern recognition machines!

Referenzen

ÄHNLICHE DOKUMENTE

[r]

b) Use this to construct an asynchronous BFS tree construction algorithm of time com- plexity O(D) that uses O(|E|D) messages and terminates. You may assume that D is known here..

Lothar Sebastian Krapp Simon Müller. WS 2018

The energy levels ǫ J,n of our molecule are enumerated by the angular momentum and the radial quantum number n.. To understand the structure of the low-lying energy levels we

In the economy the families, investors and governments who make the higher number of ‘right’ choices in market terms are the ones who win a bigger portion of the stakes

Numerical Algorithms for Visual Computing III: Optimisation.. Michael Breuß and Kai Uwe Hagenburg

Prove that the Douglas-Rachford Splitting (14.18) is a valid splitting scheme.

Winter Semester