Uniform generation in spatial constraint databases and applications (Extended abstract)
暂无分享,去创建一个
[1] Jan van Leeuwen,et al. Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity , 1994 .
[2] Zoltán Füredi,et al. Computing the volume is difficult , 1986, STOC '86.
[3] Jianwen Su,et al. Finitely Representable Databases , 1997, J. Comput. Syst. Sci..
[4] Wen-Chi Hou,et al. Statistical estimators for relational algebra expressions , 1988, PODS '88.
[5] A. Winsor. Sampling techniques. , 2000, Nursing times.
[6] David K. Smith. Theory of Linear and Integer Programming , 1987 .
[7] Stéphane Grumbach,et al. On the Orthographic Dimension of Constraint Databases , 1999, ICDT.
[8] Jan Van den Bussche,et al. Complete Geometric Query Languages , 1999, J. Comput. Syst. Sci..
[9] Doron Rotem,et al. Sampling from spatial databases , 1995 .
[10] Fernando Affentranger,et al. On the convex hull of uniform random points in a simpled-polytope , 1991, Discret. Comput. Geom..
[11] P. Koiran. Approximating the Volume of Deenable Sets , 1995 .
[12] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[13] D. Flewelling. Comparing subsets from digital spatial archives: point set similarity , 1997 .
[14] Gabriel M. Kuper,et al. Constraint Query Languages , 1995, J. Comput. Syst. Sci..
[15] Carl A. Gunter,et al. In handbook of theoretical computer science , 1990 .
[16] György Elekes,et al. A geometric inequality and the complexity of computing volume , 1986, Discret. Comput. Geom..
[17] Jeffrey F. Naughton,et al. Query Size Estimation by Adaptive Sampling , 1995, J. Comput. Syst. Sci..
[18] Jianwen Su,et al. Queries with Arithmetical Constraints , 1997, Theor. Comput. Sci..
[19] Michael Benedikt,et al. Safe Constraint Queries , 2000, SIAM J. Comput..
[20] Doron Rotem,et al. Random Sampling from Database Files: A Survey , 1990, SSDBM.
[21] Marc Gyssens,et al. An expressive language for linear spatial database queries , 1998, J. Comput. Syst. Sci..
[22] Jan Van den Bussche,et al. Towards a theory of spatial database queries (extended abstract) , 1994, PODS '94.
[23] Jianwen Su,et al. Linear Constraint Query Languages: Expressive Power and Complexity , 1994, LCC.
[24] Richard M. Karp,et al. Monte-Carlo algorithms for enumeration and reliability problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[25] Leslie G. Valiant,et al. Random Generation of Combinatorial Structures from a Uniform Distribution , 1986, Theor. Comput. Sci..
[26] DyerMartin,et al. A random polynomial-time algorithm for approximating the volume of convex bodies , 1991 .
[27] Marek Karpinski,et al. Approximating the Volume of General Pfaffian Bodies , 1997, Structures in Logic and Computer Science.
[28] Michael Benedikt,et al. Languages for relational databases over interpreted structures , 1997, PODS '97.
[29] Kurt Mehlhorn,et al. The LEDA Platform of Combinatorial and Geometric Computing , 1997, ICALP.
[30] Jan Paredaens,et al. Towards a theory of spatial database queries (extended abstract) , 1994, PODS.
[31] Pascal Koiran,et al. Approximating the volume of definable sets , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[32] Michael Benedikt,et al. Exact and approximate aggregation in constraint query languages , 1999, PODS '99.
[33] Martin E. Dyer,et al. A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies , 1989, STOC.