Sciweavers

3984 search results - page 525 / 797
» Using linked data for systems management
Sort
View
KDD
2004
ACM
330views Data Mining» more  KDD 2004»
16 years 3 months ago
Learning to detect malicious executables in the wild
In this paper, we describe the development of a fielded application for detecting malicious executables in the wild. We gathered 1971 benign and 1651 malicious executables and enc...
Jeremy Z. Kolter, Marcus A. Maloof
HPCA
1998
IEEE
15 years 7 months ago
Efficiently Adapting to Sharing Patterns in Software DSMs
In this paper we introduce a page-based Lazy Release Consistency protocol called ADSM that constantly and efficiently adapts to the applications' sharing patterns. Adaptation...
Luiz Rodolpho Monnerat, Ricardo Bianchini
CGO
2007
IEEE
15 years 9 months ago
Persistent Code Caching: Exploiting Code Reuse Across Executions and Applications
Run-time compilation systems are challenged with the task of translating a program’s instruction stream while maintaining low overhead. While software managed code caches are ut...
Vijay Janapa Reddi, Dan Connors, Robert Cohn, Mich...
KDD
2009
ACM
228views Data Mining» more  KDD 2009»
16 years 3 months ago
A generalized Co-HITS algorithm and its application to bipartite graphs
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Hongbo Deng, Michael R. Lyu, Irwin King
SAC
2009
ACM
15 years 9 months ago
Applying latent dirichlet allocation to group discovery in large graphs
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
Keith Henderson, Tina Eliassi-Rad