|
Homepage
Wiki
|
CSE Seminars
| Date | Venue | Content | Presenter |
|---|
| 23/4/09 1000 - 1100 | K17-113 | Statistical Databases and Privacy | Dr. Ljiljana Brankovic (University of Newcastle) |
Group Meeting (09s1)
| Date | Content | Presenter |
|---|
| 1/5/09 | 1. K.G. Murty, An algorithm for ranking all the assignments in increasing order of cost, Operational Research. 16(1968) 682.
2. J.Y. Yen, Finding the K shortest loopless paths in a network, Management Science, 17(1971).
3. E.L. Lawler, A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem. Management Science, 18(1972).
4. H.W. Hamacher and M. Queyranne, K Best solutions to combinatorial optimization problems. Annals of Operations Research 4(1985).
5. B. Kimelfeld and Y. Sagiv, Finding and approximating top-k answers in keyword proximity search, PODS 2006.
6. S. Cohen, B. Kimelfeld and Y. Sagiv, Enumerating large query results, ICDE 2009 tutorial. | Yifei Lu |
| 8/5/09 | Bhargav Kanagal, Amol Deshpande. Indexing Correlated Probabilistic Databases. SIGMOD 2009. | Zhitao Shen |
| 22/5/09 | Graham Cormode,Lukasz Golab, Flip Korn, Andrew McGregor, Divesh Srivastava, Xi Zhang.
Estimating the Confidence of Conditional Functional Dependencies. SIGMOD 2009. | Zhitao Shen |
Past Group Meeting
|
