1538 search results - page 13 / 308 » Relative Randomness and Cardinality |
SIGMOD
2011
ACM
13 years 13 days ago
2011
ACM
We study the problem of generating synthetic databases having declaratively specified characteristics. This problem is motivated by database system and application testing, data ...
COCOON
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. While the original stable marriage problem requires all participants to rank all members of the opposite sex in a strict order, two natural variations are to allow for in...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
ICALP
2000
Springer
14 years 1 months ago
2000
Springer
: A 2-coloring of a hypergraph is a mapping from its vertex set to a set of two colors such that no edge is monochromatic. Let H = H k n p be a random k-uniform hypergraph on a ver...
EUSFLAT
2001
13 years 11 months ago
2001
Flexible querying aims at expressing preferences inside queries instead of strict requirements. We consider ordinary relational databases and flexible querying calling on fuzzy se...