BEGIN:VCALENDAR
PRODID:-//Campus Event Calendar//EN
X-WR-CALNAME: Campus Event Calendar
X-WR-TIMEZONE:(UTC+01:00) Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna
VERSION:2.0
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Berlin
X-LIC-LOCATION:Europe/Berlin
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;INTERVAL=1;BYDAY=-1SU;BYMONTH=3
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;INTERVAL=1;BYDAY=-1SU;BYMONTH=10
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20180523T161500
DURATION:PT1H0M0S
UID:7FFA19754B41FDC7C1258272004D267E
DTSTAMP:20180417T160241
SUMMARY:André Nusser (MPI-INF - D1) talks about "Reading Group: A fast
er algorithm for the discrete Fréchet distance under translation"
LOCATION:Saarbrücken building E1 4, room 022
CATEGORIES:MPI-Seminar [AG Audience]
CONTACT:Daniel Vaz
DESCRIPTION:Bla
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20180523-1615
-022
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20180524T130000
DURATION:PT0H30M0S
UID:C76A4C699AF04E9BC125828F0078EE64
DTSTAMP:20180517T000053
SUMMARY:Emanuele Natale (MPI-INF - D1) talks about "Pooling or Samplin
g: Collective Dynamics for Electrical Flow Estimation"
LOCATION:Saarbrücken building E1 4, room 024
CATEGORIES:AG1 Advanced Mini-Course [AG Audience]
CONTACT:Emanuele Natale
DESCRIPTION:The computation of electrical flows is a crucial primitive
for many recently \nproposed optimization algorithms on weighted netw
orks. While typically \nimplemented as a centralized subroutine, the a
bility to perform this task in a \nfully decentralized way is implicit
in a number of biological systems. Thus, a \nnatural question is whet
her this task can provably be accomplished in an \nefficient way by a
network of agents executing a simple protocol. \nWe provide a positive
answer, proposing two distributed approaches to \nelectrical flow com
putation on a weighted network: a deterministic process \nmimicking Ja
cobi's iterative method for solving linear systems, and a \nrandomized
token diffusion process, based on revisiting a classical random walk
\nprocess on a graph with an absorbing node. We show that both process
es converge \nto a solution of Kirchhoff's node potential equations, d
erive bounds on their \nconvergence rates in terms of the weights of t
he network, and analyze their \ntime and message complexity.
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20180524-1300
-024
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20180525T101500
DURATION:PT1H30M0S
UID:141E860ED9AF6372C125828E003C1334
DTSTAMP:20180515T125610
SUMMARY:Karon MacLean (University of British Columbia) & Christian Hol
z (Microsoft Research) (University of British Columbia & Microsoft Res
earch) talks about "Taking Haptic Design from Research to Practice & R
ich Haptic Shape Output Controllers for Virtual Reality"
LOCATION:Saarbrücken building E1 4, room 019
CATEGORIES:Talk [Expert Audience]
CONTACT:Kathrin Keim\, Phone: 302-71080
DESCRIPTION:Taking Haptic Design from Research to Practice \nToday’s a
dvances in tactile sensing, wearable, situated and context-aware \ncom
puting and robotics are spurring new ideas about how to configure \nto
uch-centered interactions in terms of roles and utility, which in turn
expose \nnew technical and social design questions. But while haptic
actuation and \nsensing technology is improving, incorporating them i
nto a real-world design \nprocess still brings many challenges. In thi
s talk I’ll focus on how my group \nhas approached research both into
viable roles and design languages for \nphysical communication, and of
what is needed to support their design.\nI’ll explore this in the con
text of several examples, such as translating \nusers’ cognitive frame
works for processing tactile signals into guidelines and \ntools to cr
eate learnable message vocabularies; exploiting low-cost, stretchy \nt
ouch sensors and machine learning touch recognition to raise the ‘emot
ional \nintelligence’ of social human-robot interaction through bidire
ctional \ncommunication; and how such sensing and simple outputs can t
ransform other \ninteractions that are situated in the physical world
rather than on a \ntraditional computing device. \n\n\nRich Haptic Sha
pe Output Controllers for Virtual Reality\nThe recent resurgence of vi
rtual reality has made VR systems mainstream. With \nthe advances in t
racking and input sensing, many compelling VR applications \nhave emer
ged, from video games to productivity scenarios involving virtual \nob
jects. These advances have shown the clear need for haptic solutions t
hat \noffer more than the simple buzzing and rumbling current controll
ers provide.\nIn this talk, I present an investigation of mechanically
-actuated hand-held \ncontrollers that render the shape of virtual obj
ects through physical shape \ndisplacement, enabling users to feel 3D
surfaces, textures, and forces that \nmatch the visual rendering. All
controllers create a haptic impression of much \nlarger 3D shapes as u
sers move them around by cognitively integrating output \nsensations o
ver time. I will demonstrate five types of controllers that explore \n
spatially-registered haptic feedback, from rendering surfaces through
shape \noutput for grasp and trigger feedback to rendering textures in
the form of \nsurface structure and shear during interaction. I will
also present a series of \ndynamic stiffness linkages between two cont
rollers to support bimanual tool use \nin VR, such as steering wheels
or music instruments. Finally, I will touch on \nthe insights of our e
valuations and conclude with the challenges haptic \ncontrollers face
before they, too, can become mainstream.
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20180525-1015
-019
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20180530T113000
DURATION:PT0H20M0S
UID:92649534F93AA579C125828700330A7F
DTSTAMP:20180508T111730
SUMMARY:Kurt Mehlhorn (MPI-INF - D1) talks about "Group Meeting"
LOCATION:Saarbrücken building E1 4, room 333
CATEGORIES:AG1 Group Meeting [AG Audience]
CONTACT:Christina Fries
DESCRIPTION: -
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20180530-1130
-333
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20180530T161500
DURATION:PT1H0M0S
UID:444BEC91393BB2E9C1258272004E4929
DTSTAMP:20180417T161505
SUMMARY:Eunjin Oh (MPI-INF - D1) talks about "Reading Group: Dynamic T
ime Warping and Geometric Edit Distance: Breaking the Quadratic Barrie
r"
LOCATION:Saarbrücken building E1 4, room 022
CATEGORIES:MPI-Seminar [AG Audience]
CONTACT:Daniel Vaz
DESCRIPTION:Bla
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20180530-1615
-022
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20180606T121500
DURATION:PT1H0M0S
UID:30B1829359E04945C125822B00482341
DTSTAMP:20180205T140756
SUMMARY:Anja Feldmann (MPI-INF - INET) talks about "The Internet: A Co
mplex System at its Limits"
LOCATION:Saarbrücken building E1 5, room 002
CATEGORIES:Joint Lecture Series [Public Audience]
CONTACT:Jennifer Müller\, Phone: 2900
DESCRIPTION:tbd
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20180606-1215
-002
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20180606T161500
DURATION:PT1H0M0S
UID:04A32FA84F84D225C1258272004E605E
DTSTAMP:20180417T161604
SUMMARY:Ben Wiederhake (MPI-INF - D1) talks about "Reading Group: A Di
stributed Algorithm for Minimum-Weight Spanning Trees"
LOCATION:Saarbrücken building E1 4, room 022
CATEGORIES:MPI-Seminar [AG Audience]
CONTACT:Daniel Vaz
DESCRIPTION:Bla
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20180606-1615
-022
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20180628T110000
DURATION:PT0H30M0S
UID:FF84C5BB0641442FC12582820055CB6D
DTSTAMP:20180503T173706
SUMMARY:Davis Issac (MPI-INF - D1) talks about "Spanning Tree Congesti
on and Computation of Generalized Gyori-Lovasz Partition"
LOCATION:Saarbrücken building E1 4, room 024
CATEGORIES:AG1 Mittagsseminar (own work) [AG Audience]
CONTACT:Davis Issac
DESCRIPTION:We study a natural problem in graph sparsification, the Sp
anning Tree \nCongestion (STC) problem. Informally, it seeks a spannin
g tree with no \ntree-edge \emph{routing} too many of the original edg
es.\n\nFor any general connected graph with $n$ vertices and $m$ edges
, we show that \nits STC is at most $O(\sqrt{mn})$,which is asymptotic
ally optimal since we also \ndemonstrate graphs with STC at least $\Om
ega(\sqrt{mn})$.We present a \npolynomial-time algorithm which compute
s a spanning tree with congestion \n$O(\sqrt{mn}\cdot \log n)$.We also
present another algorithm for computing a \nspanning tree with conges
tion $O(\sqrt{mn})$; this algorithm runs in \nsub-exponential time whe
n $m = \omega(n \log^2 n)$.\n\nFor achieving the above results, an imp
ortant intermediate theorem is \ngeneralized Gy\H{o}ri-Lov{\'{a}}sz th
eorem. Chen et al. in 2007 gave a \nnon-constructive proof. We give th
e first elementary and constructive proof \nwith a local search algori
thm of running time $O^*\left( 4^n \right)$. We \ndiscuss some consequ
ences of the theorem concerning graph partitioning, which \nmight be o
f independent interest.\n\nWe also show that for any graph which satis
fies certain expanding properties, \nits STC is at most $O(n)$, and a
corresponding spanning tree can be computed in \npolynomial time. We t
hen use this to show that a random graph has STC \n$\Theta(n)$ with hi
gh probability.\n
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20180628-1100
-024
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20180704T121500
DURATION:PT1H0M0S
UID:C0198FB7080BFD38C125822B004871C6
DTSTAMP:20180205T141117
SUMMARY:Maria Christakis (Max Planck Institute for Software Systems) t
alks about "Practical Program Analysis"
LOCATION:Saarbrücken building E1 5, room 002
CATEGORIES:Joint Lecture Series [Public Audience]
CONTACT:Jennifer Müller\, Phone: 2900
DESCRIPTION:Sound static analysis over-approximates the set of all pos
sible executions in a \ngiven program in order to prove the absence of
errors in the program. Due to \nthis over-approximation, sound static
analysis may generate spurious warnings \nabout executions that are n
ot wrong or even possible in the program. To become \nmore practical,
many static analyzers give up soundness by design. This means \nthat t
hey do not check certain properties or that they check them under cert
ain \nunsound assumptions, such as the absence of arithmetic overflow.
At the other \nend of the soundness spectrum, we have automatic test-
case generation, which \ntypically under-approximates the set of possi
ble program executions. The goal \nof test-case generation is not to p
rove the absence of errors in the program \nbut, rather, their existen
ce.\n \nIn this talk, I will present an overview of my research on com
bining these \nprogram analysis techniques to improve their overall au
tomation, performance, \nand accuracy on real programs.
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20180704-1215
-002
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20180705T130000
DURATION:PT0H30M0S
UID:B28339B5E333AE97C125829000582615
DTSTAMP:20180517T180249
SUMMARY:Daniel Vaz (MPI-INF - D1) talks about "Beyond Metric Embedding
: Approximating Group Steiner Trees on Bounded Treewidth Graphs"
LOCATION:Saarbrücken building E1 4, room 024
CATEGORIES:AG1 Mittagsseminar (own work) [AG Audience]
CONTACT:Daniel Vaz
DESCRIPTION:Bla
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20180705-1300
-024
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20180801T121500
DURATION:PT1H0M0S
UID:1907B5C9A158B827C125822B0048DA2E
DTSTAMP:20180205T141544
SUMMARY:Emanuele Natale (MPI-INF - D1) talks about "Algorithms and the
Brain"
LOCATION:Saarbrücken building E1 5, room 002
CATEGORIES:Joint Lecture Series [Public Audience]
CONTACT:Jennifer Müller\, Phone: 2900
DESCRIPTION:Around the mid of the 20th century, pioneering theoreticia
ns of brain science \nand computer science such as von Neumann, Turing
, McCulloch, Pitts and Barlow, \nwere beginning to leverage their inte
rests in the other field to gain a better \nunderstanding of their own
. These two fields have since then rapidly grown \ntheir prestige as s
ciences, as they became more sophisticated and their body of \nknowled
ge expanded. However, in doing so, they have also grown further apart.
\nIn this talk I will outline some recent efforts from both research c
ommunities \nto recognize the potential for what could be achieved in
a unified research \neffort to answer the question: \n"What are the al
gorithms which run our brain?"
TRANSP:OPAQUE
CLASS:PUBLIC
URL:http://domino.mpi-inf.mpg.de/internet/events.nsf/all/20180801-1215
-002
END:VEVENT
END:VCALENDAR