464 search results - page 89 / 93 » Frequent pattern mining for kernel trace data |
KDD
2005
ACM
14 years 7 months ago
2005
ACM
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
KDD
1998
ACM
13 years 11 months ago
1998
ACM
We consider the problem of aggregation for uncertain and imprecise data. For such data, we define aggregation operators and use them to provide information on properties and patte...
ACSAC
2004
IEEE
13 years 11 months ago
2004
IEEE
Host security is achieved by securing both the operating system kernel and the privileged applications that run on top of it. Application-level bugs are more frequent than kernel-...
CIDM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Some data mining problems require predictive models to be not only accurate but also comprehensible. Comprehensibility enables human inspection and understanding of the model, m...
SIGMETRICS
1999
ACM
13 years 11 months ago
1999
ACM
In this paper, we examine the availability and utility of idle memory in workstation clusters. We attempt to answer the following questions. First, how much of the total memory in...