371 search results - page 10 / 75 » Computation of the Minimal Associated Primes |
ACSC
2008
IEEE
13 years 9 months ago
2008
IEEE
A number of organizations publish microdata for purposes such as public health and demographic research. Although attributes of microdata that clearly identify individuals, such a...
KDD
2001
ACM
14 years 7 months ago
2001
ACM
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
DMKD
1997
ACM
13 years 11 months ago
1997
ACM
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
ICPP
2000
IEEE
13 years 12 months ago
2000
IEEE
In this paper a sufficient condition is given for minimal routing in n-dimensional (n-D) meshes with faulty nodes contained in a set of disjoint fault regions. It is based on an ...
DAC
2007
ACM
14 years 8 months ago
2007
ACM
The ability of modern SAT solvers to produce proofs of unsatisfiability for Boolean formulas has become a powerful tool for EDA applications. Proofs are generated from a resolve t...