A Dichotomy for Queries with Negation in Probabilistic Databases

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=G5KoZ-84Wko


Duration: 42:30
270 views
2

Dan Olteanu, University of Oxford
https://simons.berkeley.edu/talks/dan-olteanu-10-05-2016
Uncertainty in Computation



Other Videos By Simons Institute for the Theory of Computing


2016-10-06Axioms for Information Leakage
2016-10-06Pufferfish Privacy Mechanisms for Correlated Data
2016-10-06Differential Privacy
2016-10-06A Personal Viewpoint on Probabilistic Programming
2016-10-06Probabilistic Programming for Augmented Intelligence
2016-10-05Probabilistic Reasoning by First-Order Model Counting
2016-10-05Stochastic Control via Entropy Compression
2016-10-05Scalable Collective Inference from Richly Structured Data using Probabilistic Soft Logic (PSL)
2016-10-05Approximate Lifted Inference with Probabilistic Databases
2016-10-05Fourier Representations in Probabilistic Inference
2016-10-05A Dichotomy for Queries with Negation in Probabilistic Databases
2016-10-05Brief Tutorial on Probabilistic Databases
2016-10-04Three Problems in Computable Probability Theory
2016-10-04Controlling Probabilistic Systems Under Partial Observation
2016-10-04Quantitative Algebraic Reasoning
2016-10-04Computing Probabilistic Bisimilarity Distances via Policy Iteration
2016-10-04Model Checking and Strategy Synthesis for Stochastic Games: From Theory to Practice
2016-10-04Unifying Logic and Probability: The BLOG Language
2016-09-27Number-Theoretic Methods in Quantum Computing
2016-09-27Algorithm Design in the Modern Era: Dealing with Uncertainty and Incentives
2016-09-23Optimal Online Algorithms via Linear Scaling


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Uncertainty in Computation
Dan Olteanu