Sciweavers

1626 search results - page 256 / 326
» Computing the Types of the Relationships between Autonomous ...
Sort
View
JCP
2007
132views more  JCP 2007»
13 years 8 months ago
A Theoretical Framework for Organizational Network Forensic Readiness
This paper discusses breaking the escalation cycle that locks cyber intruders and their targets in a state where targets are perennially resigned to attacks and intruders are at...
Barbara Endicott-Popovsky, Deborah A. Frincke, Car...
CN
2007
148views more  CN 2007»
13 years 8 months ago
Using taxonomies for content-based routing with ants
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is known yet about its appropriateness for search i...
Elke Michlmayr, Arno Pany, Gerti Kappel
CALCO
2009
Springer
176views Mathematics» more  CALCO 2009»
14 years 3 months ago
Complementation of Coalgebra Automata
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
Christian Kissig, Yde Venema
GCC
2005
Springer
14 years 2 months ago
BlogGrid: Towards an Efficient Information Pushing Service on Blogspace
With increasing concerns about the personalized information space, users have been posting various types of information on their own blogs. Due to the domain-specific properties of...
Jason J. Jung, Inay Ha, GeunSik Jo
ICTCS
2005
Springer
14 years 2 months ago
Checking Risky Events Is Enough for Local Policies
Abstract. An extension of the λ-calculus is proposed to study historybased access control. It allows for parametrized security policies with a possibly nested, local scope. To gov...
Massimo Bartoletti, Pierpaolo Degano, Gian Luigi F...