Seminar formatting
parent
e51876fd19
commit
6b99a8963e
|
@ -21,7 +21,7 @@ schedule:
|
|||
- when: Mar. 14
|
||||
what: __Spring Break__
|
||||
- when: Mar. 21
|
||||
who: Wolfgang Gatterbaur (CMU)
|
||||
who: Wolfgang Gatterbauer (CMU)
|
||||
what: Approximate lifted inference with probabilistic databases
|
||||
abstract: |
|
||||
Probabilistic inference over large data sets is becoming a central data management problem. Recent large knowledge bases, such as Yago, Nell or DeepDive have millions to billions of uncertain tuples. Yet probabilistic inference is known to be #P-hard in the size of the database, even for some very simple queries. This talk shows a new approach that allows ranking answers to hard probabilistic queries in guaranteed polynomial time, and by using only basic operators of existing database management systems (e.g., no sampling required).
|
||||
|
@ -58,6 +58,8 @@ extraCSS:
|
|||
|
||||
# {{title}}
|
||||
|
||||
The UBDB seminar meets on Mondays at 10:30 AM, typically in Davis 113A. Subscribe to cse-database-list for more details.
|
||||
|
||||
<div class="seminar">
|
||||
{{#each schedule}}
|
||||
|
||||
|
|
Loading…
Reference in New Issue