BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20170326T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20161030T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260428T111130Z
UID:58ad555977d56202801896@ist.ac.at
DTSTART:20170310T150000
DTEND:20170310T163000
DESCRIPTION:Speaker: Kuldeep S. Meel\nAbstract: Constrained counting and sa
 mpling are two fundamental problems in Computer Science with numerous appl
 ications\, including network reliability\, privacy\, probabilistic reasoni
 ng\, and constrained-random verification. In constrained counting\, the ta
 sk is to compute the total weight\, subject to a given weighting function\
 , of the set of solutions of the given constraints . In constrained sampli
 ng\, the task is to sample randomly\, subject to a given weighting functio
 n\, from the set of solutions to a set of given constraints. \n\nIn this t
 alk\, I will introduce a novel algorithmic framework for constrained sampl
 ing and counting that combines the classical algorithmic technique of univ
 ersal hashing with the dramatic progress made in Boolean reasoning over th
 e past two decades.  This has allowed us to obtain breakthrough results in
  constrained sampling and counting\, providing a new algorithmic toolbox i
 n machine learning\, probabilistic reasoning\, privacy\, and design verifi
 cation .  I will demonstrate the utility of the above techniques on variou
 s real applications including probabilistic inference\, design verificatio
 n and our ongoing collaboration  in estimating the reliability of critical
  infrastructure networks during natural disasters. \n\nBio:\n\nKuldeep Mee
 l is a final year PhD candidate in Rice University working with Prof. Mosh
 e Vardi and Prof. Supratik Chakraborty. His research broadly lies at the i
 ntersection of artificial intelligence and formal methods. He is the recip
 ient of a 2016-17 IBM PhD Fellowship\, the 2016-17 Lodieska Stockbridge Va
 ughn Fellowship and the 2013-14 Andrew Ladd Fellowship. His research won t
 he best student paper award at the International Conference on Constraint 
 Programming 2015. He obtained a B.Tech. from IIT Bombay and an M.S. from R
 ice in 2012 and 2014 respectively.  He co-won the 2014 Vienna Center of Lo
 gic and Algorithms International Outstanding Masters thesis award.
LOCATION:Mondi Seminar Room 2\, Central Building\, ISTA
ORGANIZER:pnovotny@ist.ac.at
SUMMARY:Kuldeep S. Meel: Constrained Counting and Sampling: Bridging the Ga
 p between Theory and Practice
URL:https://talks-calendar.ista.ac.at/events/364
END:VEVENT
END:VCALENDAR