6251 search results - page 110 / 1251 » Randomness, Computability, and Density |
111
Voted
CIE
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We show the following results for polynomial-time reducibility to RC , the set of Kolmogorov random strings.
149
click to vote
KDD
2007
ACM
16 years 1 months ago
2007
ACM
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...
96
Voted
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper, we use random-selection protocols in the full-information model to solve classical problems in distributed computing. Our main results are the following: • An O(l...
42
Voted
COMPUTER
2002
15 years 14 days ago
2002
99
Voted
ICDM
2003
IEEE
15 years 6 months ago
2003
IEEE
This paper presents interpretations for association rules. It first introduces Pawlak’s method, and the corresponding algorithm of finding decision rules (a kind of association ...