7623 search results - page 1190 / 1525 » Algorithmic Features of Eclat |
194
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
We present and empirically analyze a machine-learning approach for detecting intrusions on individual computers. Our Winnowbased algorithm continually monitors user and system beh...
173
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
Images are highly complex multidimensional signals, with rich and complicated information content. For this reason they are difficult to analyze through a unique automated approach...
210
Voted
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
176
click to vote
MOBIHOC
2006
ACM
16 years 6 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
161
click to vote
ISPD
2010
ACM
16 years 1 months ago
2010
ACM
In the nanometer IC design, dummy fill is often performed to improve layout pattern uniformity and the post-CMP quality. However, filling dummies might greatly increase intercon...