Query-Competitive Algorithms for Computing with Uncertainty
暂无分享,去创建一个
[1] Thomas Erlebach,et al. Minimum Spanning Tree Verification Under Uncertainty , 2014, WG.
[2] Simon Kahan,et al. A model for data in motion , 1991, STOC '91.
[3] Maarten Löffler,et al. Largest and Smallest Convex Hulls for Imprecise Points , 2010, Algorithmica.
[4] Rajeev Raman,et al. Efficient Update Strategies for Geometric Computing with Uncertainty , 2003, CIAC.
[5] Jennifer Widom,et al. Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data , 2000, VLDB.
[6] David G. Kirkpatrick,et al. Input-Thrifty Extrema Testing , 2011, ISAAC.
[7] Thomas Erlebach,et al. Computing Minimum Spanning Trees with Uncertainty , 2008, STACS.
[8] Jennifer Widom,et al. Computing the median with uncertainty , 2000, STOC '00.
[9] Venkatesan Guruswami,et al. Query strategies for priced information (extended abstract) , 2000, STOC '00.
[10] Yogish Sabharwal,et al. The Update Complexity of Selection and Related Problems , 2015, Theory of Computing Systems.
[11] Rajeev Motwani,et al. Computing shortest paths with uncertainty , 2003, J. Algorithms.
[12] Alejandro López-Ortiz,et al. On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods , 2014, Theory of Computing Systems.
[13] Thomas Erlebach,et al. Query-competitive algorithms for cheapest set problems under uncertainty , 2014, Theor. Comput. Sci..
[14] Maarten Löffler,et al. Largest bounding box, smallest diameter, and related problems on imprecise points , 2007, Comput. Geom..
[15] Michael Hoffmann,et al. Verification Problem of Maximal Points under Uncertainty , 2013, IWOCA.
[16] Sanjeev Khanna,et al. On computing functions with uncertainty , 2001, PODS '01.