Sciweavers

991 search results - page 118 / 199
» The query-flow graph: model and applications
Sort
View
AOSD
2007
ACM
14 years 3 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
CVPR
2005
IEEE
15 years 1 months ago
Corrected Laplacians: Closer Cuts and Segmentation with Shape Priors
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...
David Tolliver, Gary L. Miller, Robert T. Collins
CCS
2003
ACM
14 years 4 months ago
Learning attack strategies from intrusion alerts
Understanding the strategies of attacks is crucial for security applications such as computer and network forensics, intrusion response, and prevention of future attacks. This pap...
Peng Ning, Dingbang Xu
BTW
2001
Springer
103views Database» more  BTW 2001»
14 years 3 months ago
On Realizing Transformation Independence in Open, Distributed Multimedia Information Systems
In this article, we present our efforts1 on realizing transformation independence in open, extensible, and highly distributed multimedia information The main focus is on the abstra...
Ulrich Marder
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
14 years 11 months ago
Eigenspace-based anomaly detection in computer systems
We report on an automated runtime anomaly detection method at the application layer of multi-node computer systems. Although several network management systems are available in th...
Hisashi Kashima, Tsuyoshi Idé