Structures - The Basic Toolbox, Springer, 2008 (ISBN: 9783540779773) [CLRS] T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, Introduction to Algorithms - Second Edition, McGraw-Hill, 2001 (ISBN: 0262531968)
r: Abenteuer Informatik (ISBN: 9783827419262 ) B. Vöcking, H. Alt, M. Dietzfelbinger, R. Reischuk, C. Scheideler, H. Vollmer, D. Wagner: Taschenbuch der Algorithmen (ISBN: 9783540763932 ) Minsky: The Society
instance, we will prove that solving a particular problem requires running time at least 2 n or n c for some c, assuming some plausible complexity assumptions. Inapproximability (2 lectures) : We will prove
Recognition (CVPR), 2015. [3] Pedestrian Attribute Recognition at Far Distance , Y. Deng, P. Luo, C. C. Loy, X. Tang, In Proceedings of ACM Multimedia (ACM MM), 2014. How Far are We from Solving Pedestrian
Learning and Principles and Practice of Knowledge Discovery in Databases, pp. 36–52. [ PDF ] Teflioudi, C., Gemulla, R. & Mykytiuk, O., 2015. LEMP: Fast Retrieval of Large Entries in a Matrix Product. In 2015 [...] ACM SIGIR conference on Research & development in information retrieval, pp. 183–192. [ PDF ] Chi, E.C. & Kolda, T.G., 2012. On Tensors, Sparsity, and Nonnegative Factorizations. SIAM Journal on Matrix Analysis [...] Tensor Factorization. In 13th IEEE International Conference on Data Mining, pp. 1037–1042. [ PDF ] Hu, C. et al., 2015. Scalable Bayesian Non-negative Tensor Factorization for Massive Count Data. In 2015 European
Time Place Group Name Time Place Group A Tuesday 16-18 Room 024 Group B Tuesday 16-18 Room 021 Group C Thursday 16-18 Room 021 Group D Thursday 16-18 Room 021 Group E Friday 14-16 Room 021 All tutorial rooms [...] will be NO lecture on Thursday 11 February. Please register for the Oral Exam. Jan 4: Tutorial groups C and D are merged. Meeting room is MPI 021. Dec 21: Final grades of midterm 2 are online. Check here