3172 search results - page 46 / 635 » On the Random-Self-Reducibility of Complete Sets |
135
click to vote
ADC
2003
Springer
15 years 6 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
178
Voted
BSL
2011
14 years 7 months ago
2011
show that an abstract analysis of one of these three set theoretic principles can sometimes lead us to results that do not require additional axioms at all but which could have bee...
KDD
2002
ACM
16 years 1 months ago
2002
ACM
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
ICQNM
2007
IEEE
15 years 7 months ago
2007
IEEE
— From a geometric viewpoint, quantum nonlocality between two parties is represented as the difference of two convex bodies, namely the sets of possible results of classical and ...
94
Voted
ESA
2007
Springer
15 years 6 months ago
2007
Springer
In real systems, such as operating systems, the scheduler is often unaware of the remaining work in each job or of the ability of the job to take advantage of more resources. In th...