Algorithms Seminar/Fall10
From ResearchWiki
(→Synopsis) |
(→Schedule) |
||
| Line 24: | Line 24: | ||
| Aug 25 || Models of Data Uncertainty || || [http://www.cs.utah.edu/~jeffp Jeff Phillips] | | Aug 25 || Models of Data Uncertainty || || [http://www.cs.utah.edu/~jeffp Jeff Phillips] | ||
|- | |- | ||
| - | | | + | | colspan="4" bgcolor="#dddddd" style = "text-align:center" | '''Geometry''' |
|- | |- | ||
| Sep 1 || Range Spaces and epsilon-Samples || [??? others][http://valis.cs.uiuc.edu/~sariel/teach/notes/aprx/lec/05_vc_dim.pdf Sariel's Notes] || | | Sep 1 || Range Spaces and epsilon-Samples || [??? others][http://valis.cs.uiuc.edu/~sariel/teach/notes/aprx/lec/05_vc_dim.pdf Sariel's Notes] || | ||
| Line 36: | Line 36: | ||
| Sep 29 || Hardness of Uncertainty Problems || [http://www.cs.washington.edu/homes/suciu/vldbj-probdb.pdf Efficient Query Evaluation on Probabilistic Databases][see Jeff for preprint] || | | Sep 29 || Hardness of Uncertainty Problems || [http://www.cs.washington.edu/homes/suciu/vldbj-probdb.pdf Efficient Query Evaluation on Probabilistic Databases][see Jeff for preprint] || | ||
|- | |- | ||
| - | | | + | | colspan="4" bgcolor="#dddddd" style = "text-align:center" | '''Databases''' |
|- | |- | ||
| Oct 6 || Histograms || [http://dimacs.rutgers.edu/~graham/pubs/html/CormodeGarofalakis09.html Histograms and wavelets on probabilistic data] [http://www.cs.umass.edu/~mcgregor/papers/09-vldb.pdf Probabilistic Histograms for Probabilistic Data] || | | Oct 6 || Histograms || [http://dimacs.rutgers.edu/~graham/pubs/html/CormodeGarofalakis09.html Histograms and wavelets on probabilistic data] [http://www.cs.umass.edu/~mcgregor/papers/09-vldb.pdf Probabilistic Histograms for Probabilistic Data] || | ||
| Line 48: | Line 48: | ||
| Nov 10 || Indexing / Range Searching || [http://www.cse.ust.hk/~yike/pods09-urange.pdf Indexing Uncertain Data] with [http://www.cse.ust.hk/~yike/urange-shorttalk.pdf slides]|| | | Nov 10 || Indexing / Range Searching || [http://www.cse.ust.hk/~yike/pods09-urange.pdf Indexing Uncertain Data] with [http://www.cse.ust.hk/~yike/urange-shorttalk.pdf slides]|| | ||
|- | |- | ||
| - | | | + | | colspan="4" bgcolor="#dddddd" style = "text-align:center" | '''Machine Learning And Statistics''' |
|- | |- | ||
| Nov 17 || Particle Filters || || | | Nov 17 || Particle Filters || || | ||
Revision as of 03:55, 21 May 2010
Modelling Data With Uncertainty
Wed 1:25-2:45pm
MEB 3147 (LCR)
Contents |
Synopsis
We will cover many recent developments in the modeling and processing of uncertain data in computer science. First we will overview different models of uncertainty, tracing their origins and motivation (Many-world models in databases, imprecision models in geometry, probabilistic models in databases). Then we will proceed to survey recent developments in computational geometry, databases, and machine learning and statistics. Highlights in computational geometry will describe algorithmic analysis to answer basic geometry problems, either with respect to worst case bounds or by formally approximating the distributions. Work in databases has focused on data structures to quickly retrieve summary queries of large data sets with respect to the underlying data uncertainty. This topic has been studied for longer in machine learning and statistics so we will summarize classic techniques and see some recent developments. Through this seminar participants will gain an understanding of the state-of-the-art in modeling and processing uncertain data and will be exposed to several important open problems and exciting research directions.
Schedule
(subject to change)