暂无分享,去创建一个
Thomas Erlebach | Matús Mihalák | Danny Krizanc | Michael Hoffmann | Rajeev Raman | D. Krizanc | R. Raman | T. Erlebach | Matús Mihalák | Michael Hoffmann
[1] Jennifer Widom,et al. Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data , 2000, VLDB.
[2] Sanjeev Khanna,et al. On computing functions with uncertainty , 2001, PODS '01.
[3] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.
[4] Adam Kasperski,et al. An approximation algorithm for interval data minmax regret combinatorial optimization problems , 2006, Inf. Process. Lett..
[5] Hande Yaman,et al. The robust spanning tree problem with interval data , 2001, Oper. Res. Lett..
[6] Pascal Van Hentenryck,et al. On the complexity of the robust spanning tree problem with interval data , 2004, Oper. Res. Lett..
[7] Rajeev Raman,et al. Efficient Update Strategies for Geometric Computing with Uncertainty , 2003, CIAC.
[8] Jennifer Widom,et al. Computing the median with uncertainty , 2000, STOC '00.
[9] Rajeev Raman,et al. Efficient Update Strategies for Geometric Computing with Uncertainty , 2003, Theory of Computing Systems.
[10] Rajeev Motwani,et al. Computing shortest paths with uncertainty , 2003, J. Algorithms.
[11] Simon Kahan,et al. A model for data in motion , 1991, STOC '91.
[12] Maarten Löffler,et al. Largest and Smallest Tours and Convex Hulls for Imprecise Points , 2006, SWAT.