Sciweavers

866 search results - page 125 / 174
» Bidirectionalizing graph transformations
Sort
View
CVPR
2010
IEEE
15 years 6 months ago
Disambiguating Visual Relations Using Loop Constraints
Repetitive and ambiguous visual structures in general pose a severe problem in many computer vision applications. Identification of incorrect geometric relations between images s...
Christopher Zach, Manfred Klopschitz, Marc Pollefe...
STACS
2007
Springer
15 years 3 months ago
A Cubic Kernel for Feedback Vertex Set
In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, w...
Hans L. Bodlaender
INFOVIS
2005
IEEE
15 years 3 months ago
Interactive Sankey Diagrams
We present a system that allows users to interactively explore complex flow scenarios represented as Sankey diagrams. Our system provides an overview of the flow graph and allows ...
Patrick Riehmann, Manfred Hanfler, Bernd Froehlich
CCS
2003
ACM
15 years 3 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
NOMS
2002
IEEE
130views Communications» more  NOMS 2002»
15 years 2 months ago
End-to-end service failure diagnosis using belief networks
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
Malgorzata Steinder, Adarshpal S. Sethi