Sciweavers

228 search results - page 43 / 46
» The KGP Model of Agency
Sort
View
COMPGEOM
2010
ACM
14 years 21 days ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
CCS
2001
ACM
14 years 3 days ago
Practical forward secure group signature schemes
A group signature scheme allows a group member to sign messages anonymously on behalf of the group, while in case of a dispute, a designated entity can reveal the identity of a si...
Dawn Xiaodong Song
SP
2000
IEEE
105views Security Privacy» more  SP 2000»
13 years 12 months ago
Open Source in Security: Visiting the Bizarre
Although open-source software development has virtues, there is reason to believe that the approach would not have a significant effect on the security of today’s systems. The ...
Fred B. Schneider
ICALP
1998
Springer
13 years 12 months ago
Deciding Bisimulation-Like Equivalences with Finite-State Processes
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
Petr Jancar, Antonín Kucera, Richard Mayr
ICCD
1997
IEEE
94views Hardware» more  ICCD 1997»
13 years 11 months ago
Pseudo-Random Pattern Testing of Bridging Faults
: This paper studies pseudo-random pattern testing of bridging faults. Although bridging faults are generally more random pattern testable than stuck-at faults, examples are shown ...
Nur A. Touba, Edward J. McCluskey