Search

Bhattarai 2009 - 2011 cleaned our code for 64-Bit, in particular removed warnings and adjusted the code to C standards. Martin Bromberger 2014 - is developing efficient arithmetic constraint solvers. Dominik Wagner

diversity - Empowerment Workshop Tuesday, 29.03.2022, 14.00 – 18.00 p.m. on Zoom Organized for BIPoC doctoral students exclusively, the empowerment workshop is led by Dr. Lana Sirri and Loubna Messaoudi [...] workshop aims to provide a safe space and opportunity for discussion about potential career paths for BIPoC after graduation in NGO and start-up work in Germany. The participants will examine the existing structural [...] English and German. To provide a safe space for discussion, the workshop is exclusively offered to BIPoC (Black Indigenous People of Color) PhD students. Please register by Tuesday, 22.03.2022 by sending an

Logical rules encode frequent correlations in the data. For example the rule: ?x <hasChild> ?c ?y <hasChild> ?c => ?x <isMarriedTo> ?y states that people having children in common are frequently married [...] taking all bindings of the head variables in the body of the rule which are not in the head (sets B, C and D in our mining model). For instance, for the rule ?s <livesIn> ?o => ?s <isCitizenOf> ?o, we produce

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

semantic annotations in IR (e.g., named entities, temporal expressions, or geographic references), (c) mining and organizing text, news documents, and social media data and (d) learning to rank documents

handle.net/21.11116/0000-0010-8F9E-C %R 10.1007/978-3-031-73668-1_26 %D 2024 %B 18th European Conference on Computer Vision %Z date of event: 2024-09-29 - 2024-10-04 %C Milano, Italy %B Computer Vision -- [...] net/21.11116/0000-000C-11FF-2 %R 10.1109/CVPR52688.2022.00053 %D 2022 %B 35th IEEE/CVF Conference on Computer Vision and Pattern Recognition %Z date of event: 2022-06-19 - 2022-06-24 %C New Orleans, LA, USA [...] The 38th Annual AAAI Conference on Artificial Intelligence %Z date of event: 2024-02-20 - 2024-02-27 %C Vancouver, Canada %B Proceedings of the 38th AAAI Conference on Artificial Intelligence %P 20623 - 20631

%U http://hdl.handle.net/21.11116/0000-000F-B0C5-B %D 2024 %B 41at International Conference on Machine Learning %Z date of event: 2024-07-21 - 2024-07-27 %C Vienna, Austria %B Proceedings of the 41st I [...] Smoothing : %G eng %U http://hdl.handle.net/21.11116/0000-000F-D70F-F %I Universit&#228;t des Saarlandes %C Saarbr&#252;cken %D 2024 %P XII, 57 p. %V master %9 master PuRe BibTeX

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

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)

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)