Random generation of combinatorial structures from a uniform
Theoretical Computer Science
Computing the volume is difficult
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A random polynomial-time algorithm for approximating the volume of convex bodies
Journal of the ACM (JACM)
On the convex hull of uniform random points in a simple dpolytope
Discrete & Computational Geometry
Handbook of theoretical computer science (vol. A): algorithms and complexity
Handbook of theoretical computer science (vol. A): algorithms and complexity
Towards a theory of spatial database queries (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query size estimation by adaptive sampling
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Randomized algorithms
Queries with arithmetical constraints
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Random walks and an O*(n5) volume algorithm for convex bodies
Random Structures & Algorithms
Comparing subsets from digital spatial archives: point set similarity
Comparing subsets from digital spatial archives: point set similarity
Finitely representable databases
Journal of Computer and System Sciences - Special issue on principles of database systems
Relational expressive power of constraint query languages
Journal of the ACM (JACM)
An expressive language for linear spatial database queries
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Exact and approximate aggregation in constraint query languages
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Statistical estimators for relational algebra expressions
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complete geometric query languages
Journal of Computer and System Sciences
Relational queries over interpreted structures
Journal of the ACM (JACM)
SIAM Journal on Computing
Approximating the Volume of General Pfaffian Bodies
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Linear Constraint Query Languages: Expressive Power and Complexity
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Approximating the volume of definable sets
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Random sampling from database files: a survey
SSDBM'1990 Proceedings of the 5th international conference on Statistical and Scientific Database Management
Monte-Carlo algorithms for enumeration and reliability problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Hi-index | 0.00 |
We study the efficient approximation of queries in linear constraint databases using sampling techniques. We define the notion of an almost uniform generator for a generalized relation and extend the classical generator of Dyer, Frieze and Kannan for convex sets to the union and the projection of relations. For the intersection and the difference, we give sufficient conditions for the existence of such generators. We show how such generators give relative estimations of the volume and approximations of generalized relations as the composition of convex hulls obtained from the samples.