4066 search results - page 112 / 814 » Almost Complete Sets |
165
click to vote
TCC
2010
Springer
16 years 1 months ago
2010
Springer
Introduced by Micali, Rabin and Kilian (MRK), the basic primitive of zero-knowledge sets (ZKS) allows a prover to commit to a secret set S so as to be able to prove statements such...
207
click to vote
MICRO
2003
IEEE
15 years 11 months ago
2003
IEEE
A virtual instruction set architecture (V-ISA) implemented via a processor-specific software translation layer can provide great flexibility to processor designers. Recent examp...
206
click to vote
ADC
2003
Springer
15 years 11 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...
281
click to vote
BSL
2011
15 years 1 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...
165
click to vote
KDD
2002
ACM
16 years 6 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 ...