Search

We found 527 hits for your search of 'Algorithms and Complexity'.
  1. People

    /departments/inet/people

    Assistant Professor Aalto University, Helsinki (after having graduated with the MPI-Inf Dep. Algorithms and Complexity, Saarbruecken, Germany) Daniel Wagner Researcher DE-CIX Management GmbH, Frankfurt, Germany [...] (Ben) Hui Professor & Director HKUST-DT System and Media Laboratory (SyMLab) at Computer Science and Engineering Department of Hong Kong University of Science and Technology, China Petr Kuznetsov Professor [...] IPInfo Reese Enghardt Internet Researcher and Engineer Netflix, USA Thorben Krüger Researcher Institut für Intelligente Kooperierende Systeme (IKS); AG Networks and Distributed Systems (Netsys) Lab at the

  2. Internet Architecture

    /departments/inet

    growth, and societal advancement. Understanding and nurturing this infrastructure is essential for ensuring a prosperous and interconnected future. more More information Emerging Platforms and Communities [...] applications interact and should interact with the infrastructure, design appropriate network management mechanisms and security mechanisms, explore how to incentivize efficient network usage and network upgrades [...] much like cloud resources - can grow, shrink, and/or be moved dynamically. Among the future challenges in this context are algorithms to scale, shrink, and place CloudNets, what tailored protocol to use

  3. David Stutz

    /departments/computer-vision-and-machine-learning/people/alumni-and-former-members/david-stutz

    , TITLE = {Random and Adversarial Bit Error Robustness: {E}nergy-Efficient and Secure {DNN} Accelerators}, AUTHOR = {Stutz, David and Chandramoorthy, Nandhini and Hein, Matthias and Schiele, Bernt}, LANGUAGE [...] Adversarial Training without Perturbing all Examples}, AUTHOR = {Losch, Max and Omran, Mohamed and Stutz, David and Fritz, Mario and Schiele, Bernt}, LANGUAGE = {eng}, URL = {https://openreview.net/forum? [...] Chandramoorthy, M. Hein, and B. Schiele “Random and Adversarial Bit Error Robustness: Energy-Efficient and Secure DNN Accelerators,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol

  4. Knowledge Representation for the Semantic Web

    /departments/databases-and-information-systems/teaching/winter-semester-201718/knowledge-representation-for-the-semantic-web

    will study the syntax and semantics of the main ontology and rule-based languages. On the practical side we will exploit the available tools for the knowledge representation and reasoning. Prerequisites [...] Logics I (motivation and syntax) Nov 16 Description Logics II Assignment 1 (semantics, DL nomenclature, equivalences) Nov 23 Description Logics III Project 1 (modeling, DLs and OWL) Nov 30 Description [...] logic programs, guess and check methodology, programming techniques) Dec 21 Answer Set Programming III dlv examples Dec. 28 no lecture Jan 04 no lecture Jan 11 23:55 Hybrid ASP and Rule Learning Deadline

  5. Information Retrieval and Data Mining

    /departments/databases-and-information-systems/teaching/winter-semester-201718/information-retrieval-and-data-mining

    these contexts. IR models and algorithms include text indexing, query processing, search result ranking, and information extraction for semantic search. DM models and algorithms include pattern mining, rule [...] Research Departments Databases and Information Systems Teaching Winter Semester 2017/18 Information Retrieval and Data Mining Information Retrieval and Data Mining Core course, 9 ECTS credits, winter semester [...] Strötgen Coordinators and Contact Asia Biega and Panagiotis Mandros Lectures Wednesdays, 14-16, E1 3 - Hörsaal II (0.02) and Fridays, 12-14, E1 3 - Hörsaal II (0.02) (first lecture will be on Wednesday, Oct 18)

  6. Knowledge Bases

    /departments/databases-and-information-systems/teaching/winter-semester-201718/knowledge-bases

    knowledge) and non-textual KBs (e.g., ImageNet). We explore how these KBs are constructed and how they are used in various applications such as question answering (QA), story/script prediction and biography [...] minutes break 14:45-15:00 Closing remarks Rules and Grading Participation in the kick-off meeting, the "How to prepare and present a seminar talk" lecture, and both days of the block seminar is mandatory. [...] using KBs and text -- Aydan Rende (Paramita) Question answering on Freebase via relation extraction and textual evidence (Xu et al., ACL 2016) [ pdf ] Open question answering over curated and extracted

  7. Ideen und Konzepte der Informatik

    /departments/algorithms-complexity/teaching/winter17/ideen

    Research Departments Algorithms and Complexity Teaching Ideen und Konzepte der Informatik Ideen und Konzepte der Informatik Veranstaltungen für Studierende anderer Fakultäten, 2+2 Allgemeine Informationen [...] 14/15 Ideen und Konzepte der Informatik Computer Algebra Algorithmic Game Theory, Mechanism Design and Computational Economics Fine-Grained Complexity Theory Theory of Distributed Systems

  8. Computer Algebra

    /departments/algorithms-complexity/teaching/winter17/comp-alg

    method, complex root finding. modular arithmetic and modular algorithms : evaluation, interpolation, Chinese Remainder Algorithm, prime number tests. discrete and Fast Fourier transformation : fast mul [...] the most fundamental and ubiquitous algorithms in computer algebra. We further focus on topics related to geometric computing with (real) algebraic curves and surfaces. numbers and arithmetics : school [...] ion. geometric algorithms : topology of algebraic curves and surfaces, arrangement computation. Information and Rules This is a theoretical core course for computer science students and an applied mathematics

  9. Algorithmic Game Theory, Mechanism Design and Computational Economics

    /departments/algorithms-complexity/teaching/winter17/agt

    Research Departments Algorithms and Complexity Teaching Algorithmic Game Theory, Mechanism Design and Computational Economics Algorithmic Game Theory, Mechanism Design and Computational Economics Advanced [...] from enrolled students: Basic knowledge in algorithms and data structure, and their analyses Calculus, including the concepts of limit, convergence, derivative and integration Basic Linear Algebra, including [...] ns, expected values and variances) Linear programming and its duality Basic max-flow algorithm, e.g. Ford-Fulkerson For more details about course logistics, syllabus, exercises and examinations, click

  10. Fine-Grained Complexity Theory

    /departments/algorithms-complexity/teaching/winter17/fine-complexity

    Research Departments Algorithms and Complexity Teaching Fine-Grained Complexity Theory Fine-Grained Complexity Theory Advanced Course, 3+1 Lectures: Tuesday + Thursday, 16:15 - 18:00, E1.4 024 Lecturers: [...] at the intersection of complexity theory and algorithm design which aims at a more fine-grained view of the complexity of polynomial-time problems. We present a mix of upper and lower bounds for fundamental [...] lecture notes by M. Bläser and C. Saha on [division] and [multipoint evaluation and interpolation] Lecture 18 (16 Jan) Randomized Nondeterministic SETH is false; arithmetic circuits and the Schwartz-Zippel lemma