2434 search results - page 8 / 487 » Algorithmic Randomness of Closed Sets |
98
Voted
STOC
1997
ACM
15 years 7 months ago
1997
ACM
175
Voted
IEAAIE
2009
Springer
15 years 10 months ago
2009
Springer
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
114
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
130
Voted
SPIRE
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...