THEORY SEMINAR: Speaker: Hossein Naeemi, Maastricht UniversityTitle: Implementability in multidimensional domains, a network approachAbstract: We study implementable (incentive compatible) allocation rules based on a network approach when types are multi-dimensional, the mechanism designer may use monetary transfers, and agents have quasi-linear…
Title: When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic MatchingsAbstract: Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy matching in the randomly generated graph. However, the only way we can find out…
Title: Flow Modelling on Triangulated Terrains: Computational Problems in Theory and PracticeSpeaker: Constantinos Tsirogiannis, Aarhus UniversityAbstract:One of the most popular ways to represent a terrain is the Triangulated Irregular Network (TIN), that is a 2D triangulation where each vertex has also an elevation value. The natural way of…
Arrangør: May/Fys - TutorgruppenStedkode: 5011
On Friday 3 February Matteo Magnani will give a Friday Lecture on:Selecting stars: representative skylines for finding interesting records under multiple criteriaAbstract:Which basketball player has been the Most Valuable Player of the last NBA season? Which materials should we use to build in a short time a product that is cheap but is still…
Kunne du tænke dig at være tutor og studerer du på et af institutterne for Datalogi, Fysik og Astronomi, Matematik eller iNANO? Så kon til 0. stormøde og hør om arbejdet og hvordan du bliver tutor.Arrangør: Mat/Fys - TutorgruppenStedkode: 5011
Speaker: Jonas Kolker.Title: The NP-hardness of selected puzzlesAbstract:Solving puzzles is a popular pastime. There's a vast literature onthe complexity of finding solutions to puzzles. Most interestingpuzzles are NP-complete, yet lend themselves well to human intuition.A few well-known examples of puzzles for which finding solutions…
Speaker: John Steinberger, Tsinghua University IIISTitle: Hellinger distance and adaptivityAbstract: We will review and introduce the notion of Hellingerdistance, which is a distance measure for probability distributionsthat is particularly useful for working with product distributions. Wewill show how Hellinger distance can be used to upper bound…
http://science.au.dk/uddannelse/phd-uddannelse/om-graduate-school-of-science-and-technology/phd-forsvar/phd-forsvar/artikel/low-power-wireless-sensor-network-infrastructures/