Wolfgang Pauli Institute (WPI) Vienna |
|||||
|---|---|---|---|---|---|
| Home | WPI in a nutshell | Practical Information | Events | People | WPI Projects |
| Login | Thematic Programs | Pauli Fellows | Talks | Research Groups | |
| David Woodruff | HS 1 | Mon, 4. Sep 17, 13:30 |
| Sketching for geometric problems | ||
I will give an overview of the technique of sketching, or randomized data dimensionality reduction, and its applications to fundamental geometric problems such as projection (regression) onto flats and more general objects, as well as low rank approximation and clustering applications. | ||
| ||
| Babak Falsafi | HS 1 | Tue, 5. Sep 17, 13:30 |
| The clouds have taken over, but algorithms are here to save the day | ||
Cloud providers are building infrastructure at unprecedented speeds. We have witnessed the emergence of data-centric information technology in almost every aspect of our life from commerce, healthcare, entertainment, governance to scientific discovery. The demand for processing, communicating and storing data has grown faster than conventional growth in digital platforms. Meanwhile the conventional silicon technologies we have relied on for the past several decades leading to the exponential growth in IT have slowed down. In light of this increase in demand on data-centric IT and the diminishing returns in platform scalability, our future increasingly relies on algorithms to save the day and enable a continued growth in IT. In this talk, I will motivate the grand challenges in scaling digital platforms and data-centric technologies, then present opportunities for hand-in-hand collaboration of algorithms and platforms. | ||
| ||
| Fabrizio Grandoni | Wed, 6. Sep 17, 9:00 | |
| A measure and conquer approach for the analysis of exact algorithms | ||
Branch-and-reduce is one of the most common techniques to design exact (exponential-time) algorithms for NP-hard problems. The basic idea is to branch on a collection of “smaller” subproblems which are solved recursively. The traditional way to upper bound the running time of such algorithms is to lower bound the decrease of the “size” of each subproblem with respect to the original one. Here the size of a subproblem is traditionally measured according to the target parameter in terms of which one wishes to express the final running time (e.g., the number of nodes or edges in the input graph, the number of clauses in a CNF formula, etc.). The basic idea behind the Measure and Conquer technique is to use a non-standard measure of subproblems size, in order to implicitly exploit configurations where an “expensive” branching step leads to a “simpler” collection of subproblems. A smartly designed measure can lead to a dramatic reduction of the running time bound (without changing the algorithm!). In this talk I will illustrate Measure and Conquer with a few examples coming from my past work on this topic and from some more recent developments. | ||
| ||
| David Mount | HS 1 | Wed, 6. Sep 17, 13:30 |
| Approximation algorithms for geometric proximity problems | ||
I will present an overview of recent developments in the design of efficient approximation algorithms for geometric proximity problems. These include polytope membership, nearest neighbor searching, Euclidean minimum spanning trees, low-complexity polytope approximation, and coresets. I will discuss how new sampling techniques arising from classical concepts such as Delone sets, Macbeath regions, and the Hilbert geometry have led to a number of new results, which are simple, general, implementable, and provably close to optimal. | ||
| ||
| Kurk Pruhs | HS 1 | Thu, 7. Sep 17, 9:00 |
| The Itinerant List Update Problem | ||
I will introduce a variation of the online List Update Problem, which we call the Itinerant List Update Problem (ILU). The main difference between ILU and the standard list update problem is that in ILU the read head is not required to return to a home position between accesses. The motivation for considering ILU arises from track management within Domain Wall Memory (DWM), a promising new memory technology. I will explain DWM technology, discuss how ILU differs algorithmically from the standard list update problem, and explain what we know about the offline and online versions of ILU. This is joint work with Neil Olver, Kevin Schewior, Rene Sitters and Leen Stougie. | ||
| ||
| Daniel Delling | HS 1 | Thu, 7. Sep 17, 13:30 |
| Route planning in Transportation Networks - from Research to practice | ||
The last 15 years have seen astonishing progress in the performance of shortest path algorithms for transportation networks. In particular, for road networks, modern algorithms can be up to seven orders of magnitude faster than standard solutions. Since these algorithms enable several new applications, many of them have found their way into systems serving hundreds of millions of users every day. This talk highlights key techniques, discusses their impact on the industry, and provides an outlook on upcoming challenges. | ||
| ||
| Jie Gao | HS 1 | Fri, 8. Sep 17, 9:00 |
| New challenges in distributed sensing, processing and query of spatial data | ||
The vision of networked sensors in a ubiquitous manner has motivated the development of new algorithms on distributed sensing, processing and query of spatially and temporally separated data in the past 15 years. As smart sensing continues to spread in everyday living space, new challenges in the frontier of data privacy emerge. In this talk I would like to discuss new problems and solutions on distributed sensing and processing of location and trajectory data, which protect personally sensitive information. | ||
| ||
| Pym, David | OMP 1, Sky Lounge (12th floor) | Mon, 26. Feb 18, 9:00 |
| Logic as a modelling technology: resource semantics, systems modelling, and security | ||
Abstract | ||
| ||
| Galmiche, Didier, Kimmel, Pierre, Pym, David | OMP 1, Sky Lounge (12th floor) | Mon, 26. Feb 18, 9:55 |
| An Epistemic Resource Logic Based on Boolean BI | ||
Abstract | ||
| ||
| Ramanayake, Revantha | OMP 1, Sky Lounge (12th floor) | Mon, 26. Feb 18, 11:00 |
| Syntactic Decidability and Complexity Upper Bound for the Logic of Bunched Implication BI | ||
| ||
| Larchey-Wendling; Dominique | OMP 1, Sky Lounge (12th floor) | Mon, 26. Feb 18, 11:25 |
| Mechanising Undecidability Results in Coq: Elementary Linear Logic and Boolean BI | ||
Abstract | ||
| ||
| Vijay D'Silva, Alessandra Palmigiano, Apostolos Tzimoulis and Caterina Urban | OMP 1, Sky Lounge (12th floor) | Mon, 26. Feb 18, 11:50 |
| A proof-theoretic approach to abstract interpretation | ||
Abstract | ||
| ||
| Philip Wadler | OMP 1, Sky Lounge (12th floor) | Mon, 26. Feb 18, 14:00 |
| Propositions as Sessions | ||
Abstract | ||
| ||
| Jorge A. Pérez | OMP 1, Sky Lounge (12th floor) | Mon, 26. Feb 18, 14:45 |
| The Challenge of Typed Expressiveness in Concurrency | ||
Abstract | ||
| ||
| Matteo Maffei | OMP 1, Sky Lounge (12th floor) | Mon, 26. Feb 18, 16:00 |
| Security and Privacy by Typing in Cryptographic Systems | ||
Abstract | ||
| ||
| Giuseppe Primiero | OMP 1, Sky Lounge (12th floor) | Mon, 26. Feb 18, 16:55 |
| A Substructural Modal Type Theory to Handle Mobility Failures in Distributed Computing | ||
Abstract | ||
| ||
| Federico Aschieri, Agata Ciabattoni and Francesco A. Genco | OMP 1, Sky Lounge (12th floor) | Mon, 26. Feb 18, 17:20 |
| Logic-based Concurrent ë-Calculi | ||
| ||
| Francesco Paoli | OMP 1, Sky Lounge (12th floor) | Tue, 27. Feb 18, 9:00 |
| The Archimedean Property: New Horizons and Perspectives Joint work with Antonio Ledda and Constantine Tsinakis | ||
Abstract | ||
| ||
| José Gil-Férez, Peter Jipsen, George Metcalfe and Constantine Tsinakis | OMP 1, Sky Lounge (12th floor) | Tue, 27. Feb 18, 9:55 |
| The Amalgamation Property for Semilinear Commutative Idempotent Residuated Lattices | ||
Abstract | ||
| ||
| Nick Galatos and Adam Pøenosil | OMP 1, Sky Lounge (12th floor) | Tue, 27. Feb 18, 11:00 |
| On an Equivalence between Integral and Involutive Residuated Structures | ||
Abstract | ||
| ||
| Stefano Aguzzoli, Matteo Bianchi and Diego Valota | OMP 1, Sky Lounge (12th floor) | Tue, 27. Feb 18, 11:25 |
| The Classification of All the Subvarieties of DNMG | ||
Abstract | ||
| ||
| Stefano Bonzio, Andrea Loi and Luisa Peruzzi | OMP 1, Sky Lounge (12th floor) | Tue, 27. Feb 18, 11:50 |
| Dualities for Plonka Sums of Algebras | ||
Abstract | ||
| ||
| Petr Cintula, José Gil-Férez, Tommaso Moraschini and Francesco Paoli | OMP 1, Sky Lounge (12th floor) | Tue, 27. Feb 18, 14:00 |
| An Abstract Approach to Consequence Relations II | ||
Abstract | ||
| ||
| Michele Pra Baldi, Stefano Bonzio and Tommaso Moraschini | OMP 1, Sky Lounge (12th floor) | Tue, 27. Feb 18, 14:25 |
| Logics of Variable Inclusion | ||
Abstract | ||
| ||
| Luigi Santocanale and Maria Joâo Gouveia | OMP 1, Sky Lounge (12th floor) | Tue, 27. Feb 18, 14:50 |
| Mix ⋆ - Autonomous Quantales and the Continuous Weak Bruhat Order | ||
Abstract | ||
| ||
| Luca Tranchini and Gianluigi Bellin | OMP 1, Sky Lounge (12th floor) | Tue, 27. Feb 18, 15:55 |
| A Refutation Calculus for Intuitionistic Logic | ||
Abstract | ||
| ||
| Arnon Avron | OMP 1, Sky Lounge (12th floor) | Tue, 27. Feb 18, 16:20 |
| Purely Relevant Logics with Contraction and Its Converse | ||
Abstract | ||
| ||
| Nissim Francez and Michael Kaminski | OMP 1, Sky Lounge (12th floor) | Tue, 27. Feb 18, 16:45 |
| Structural Rules for Multi-valued Logics | ||
Abstract | ||
| ||
| Alwen Tiu | OMP 1, Sky Lounge (12th floor) | Wed, 28. Feb 18, 9:00 |
| A proof theory for dual nominal quantifiers | ||
Abstract | ||
| ||
| Lutz Straßburger | OMP 1, Sky Lounge (12th floor) | Wed, 28. Feb 18, 9:55 |
| On the Normalization of Combinatorial Proofs for Classical and Intuitionistic Logic | ||
Abstract | ||
| ||
| Andrea Aler Tubella and Alessio Guglielmi | OMP 1, Sky Lounge (12th floor) | Wed, 28. Feb 18, 11:00 |
| Subatomic Proof Systems | ||
Abstract | ||
| ||
| Marianna Girlando, Sara Negri and Nicola Olivetti | OMP 1, Sky Lounge (12th floor) | Wed, 28. Feb 18, 11:25 |
| Internal and Labelled Sequent Calculi: An Equivalence Result for Conditional Logic V | ||
Abstract | ||
| ||
| Matthias Baaz | OMP 1, Sky Lounge (12th floor) | Wed, 28. Feb 18, 11:45 |
| Fast Cut-elimination for Intuitionistic Logic | ||
Abstract | ||
| ||
| Samuel Balco, Giuseppe Greco, Alexander Kurz, M. Andrew Moshier, Alessandra Palmigiano and Apostolos Tzimoulis | OMP 1, Sky Lounge (12th floor) | Wed, 28. Feb 18, 12:15 |
| Proper Display Calculus for First-order Logic | ||
Abstract | ||
| ||
| Elaine Pimentel | OMP 1, Sky Lounge (12th floor) | Wed, 28. Feb 18, 14:20 |
| A unified view of modal and substructural logics | ||
| ||
| Carlos Olarte, Kaustuv Chaudhuri, Joelle Despeyroux and Elaine Pimentel | OMP 1, Sky Lounge (12th floor) | Wed, 28. Feb 18, 15:15 |
| Hybrid Linear Logic, Revisited | ||
Abstract | ||
| ||
| Giuseppe Greco, Fei Liang and Alessandra Palmigiano | OMP 1, Sky Lounge (12th floor) | Wed, 28. Feb 18, 16:20 |
| Measurable Kleene Algebras and Structural Control | ||
Abstract | ||
| ||
| Kaustuv Chaudhuri, Leonardo Lima and Giselle Reis | OMP 1, Sky Lounge (12th floor) | Wed, 28. Feb 18, 16:45 |
| Formalized Meta-theory of Sequent Calculi for Substructural Logics | ||
Abstract | ||
| ||
| Timo Lang | OMP 1, Sky Lounge (12th floor) | Wed, 28. Feb 18, 17:10 |
| Remarks on the Exponential Rules in Linear Logic | ||
Abstract | ||
| ||
| Baaz, Matthias (TU Wien) | Seminar Room Zemanek, TU Wien, Favoritenstrasse 9-11, 1040 Wien | Mon, 11. Jun 18, 15:45 |
| Logical Aspects of Legal Reasoning | ||
| ||
| Sartor, Giovanni (U. Bologna) | Seminar Room Zemanek, TU Wien, Favoritenstrasse 9-11, 1040 Wien | Mon, 11. Jun 18, 17:00 |
| Defeasible Legal Argumentation | ||
| ||
| Gabbay, Dov (King's College London) | Seminar Room Zemanek, TU Wien, Favoritenstrasse 9-11, 1040 Wien | Tue, 12. Jun 18, 9:00 |
| Principles of Talmudic Logic - Sample Export to Modern AI | ||
| ||
| McCrea, Lawrence (U. Cornell) | Seminar Room Zemanek, TU Wien, Favoritenstrasse 9-11, 1040 Wien | Tue, 12. Jun 18, 10:00 |
| Contextual Factors in the Interpretation of Prohibitions | ||
| ||
| Brick, David (U. Yale) | Seminar Room Zemanek, TU Wien, Favoritenstrasse 9-11, 1040 Wien | Tue, 12. Jun 18, 14:00 |
| Arguments Regarding Sati from Classical Hindu Law | ||
| ||
| Modgil, Sanjay (King's College London) | Seminar Room Zemanek, TU Wien, Favoritenstrasse 9-11, 1040 Wien | Tue, 12. Jun 18, 15:00 |
| Logic, Dialogue and Moral Reasoning | ||
| ||
| Parent, Xavier (U. Luxembourg) | Seminar Room Zemanek, TU Wien, Favoritenstrasse 9-11, 1040 Wien | Tue, 12. Jun 18, 16:30 |
| A Rule-Based Deontic Reasoner | ||
| ||
| Patil, Parimal (U. Harvard) | Seminar Room Zemanek, TU Wien, Favoritenstrasse 9-11, 1040 Wien | Wed, 13. Jun 18, 9:00 |
| The Cognition of Commands in Navya-Nyaya | ||
| ||
| Guhe, Eberhard (U. Fudan) | Seminar Room Zemanek, TU Wien, Favoritenstrasse 9-11, 1040 Wien | Wed, 13. Jun 18, 10:00 |
| Ross's Paradox and the Navya-Nyaya Interpretation of Injunctions | ||
| ||
| Cummins, Patrick (Cornell University) | Seminar Room Zemanek, TU Wien, Favoritenstrasse 9-11, 1040 Wien | Wed, 13. Jun 18, 14:00 |
| Obligation as Linguistic Category in Prabhakara's Hermeneutics of Deontology | ||
| ||
| Ollett, Andrew (U. Chicago) | Seminar Room Zemanek, TU Wien, Favoritenstrasse 9-11, 1040 Wien | Wed, 13. Jun 18, 15:00 |
| Different Deontic Concepts in Mimamsa | ||
| ||
| Impressum | webmaster [Printable version] |