Is there any answers to this question? i did not get it.

time complexity O(t^2)
space complexity not sure

thanks a lot^^

View 7 more comments

i think it should be 18. 4*3(mean)+3(covariance)+3(prior)

View 1 more comment

Is there a concise answer to this question? I cannot put my thoughts into paper.

https://www.dlsi.ua.es/~mlf/nnafmc/pbook/node28.html
should be t^2

View 3 more comments

thank you for the explanation ^.

it is 2*2, The solution is available here on studydrive on another file

No area was marked for this question

Does anyone has an idea of solutions to 1.10, 6.1 and 6.2? Thanks in advance!

View 1 more comment

Probably also residual nets? Although they may not tackle the "efficient" tag

You forgot:
How does the number of trainable parameters change, when using dropout?

View 1 more comment

Also want to know about information of the lab!

No you get reading-material beforehand.

Does anyone have solutions for the sample exam?

View 2 more comments

could some one write questions of first exam? whichever you remember is really appreciated

Good Luck Guys!

No area was marked for this question

Here the constraint is only a_n >=0. C only gets added in the next step with the slack variables.

Was anyone able to solve question 6.1 and 6.2 of the first exam from ws18/19.

What did Prof. Leibe say about the exam date during the lecture?

TBD

29.2 and 19.3

View 5 more comments

True. This is another interpretation of the problem.

Do we add the channel results together?
If yes, my result is a 2x2 matrix:
6, -6
6, 9

View 1 more comment

I got the same answer as OP (p1: -1, p2: +1)

No area was marked for this question

View 2 more comments

checkout the new question sheet. Someone updated that. It is 4x4 actually.

Thank you!

I am very certain that this was a 4x4 matrix. And the result was 2x2.

No area was marked for this question

No area was marked for this question

No programming

No area was marked for this question

No area was marked for this question

WHAT'S UP WITH THAT

?