Sciweavers

6167 search results - page 1127 / 1234
» Can Refinement be Automated
Sort
View
LPAR
2004
Springer
14 years 3 months ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel
VIZSEC
2004
Springer
14 years 3 months ago
Passive visual fingerprinting of network attack tools
This paper examines the dramatic visual fingerprints left by a wide variety of popular network attack tools in order to better understand the specific methodologies used by attack...
Gregory J. Conti, Kulsoom Abdullah
VLDB
2004
ACM
103views Database» more  VLDB 2004»
14 years 3 months ago
WIC: A General-Purpose Algorithm for Monitoring Web Information Sources
The Web is becoming a universal information dissemination medium, due to a number of factors including its support for content dynamicity. A growing number of Web information prov...
Sandeep Pandey, Kedar Dhamdhere, Christopher Olsto...
GROUP
2003
ACM
14 years 3 months ago
Concepts for usable patterns of groupware applications
Patterns, which are based on in-depth practical experience, can be instructing for the design of groupware applications as sociotechnical systems. On the basis of a summary of the...
Thomas Herrmann, Marcel Hoffmann, Isa Jahnke, Andr...
SIGCOMM
2003
ACM
14 years 3 months ago
A framework for classifying denial of service attacks
Launching a denial of service (DoS) attack is trivial, but detection and response is a painfully slow and often a manual process. Automatic classification of attacks as single- o...
Alefiya Hussain, John S. Heidemann, Christos Papad...
« Prev « First page 1127 / 1234 Last » Next »