Sciweavers

1012 search results - page 199 / 203
» What Robots Can Do
Sort
View
IANDC
2008
105views more  IANDC 2008»
13 years 7 months ago
Symbolic protocol analysis for monoidal equational theories
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
Stéphanie Delaune, Pascal Lafourcade, Denis...
KI
2008
Springer
13 years 7 months ago
Wayfinding in Scene Space
Many environments in which humans wayfind can be conveniently abstracted as networks or graphs: structures of nodes that are interconnected by edges. Examples include the street ne...
Urs-Jakob Rüetschi
JSYML
1998
61views more  JSYML 1998»
13 years 7 months ago
Superdestructibility: A Dual to Laver's Indestructibility
Abstract. After small forcing, any <κ-closed forcing will destroy the supercompactness and even the strong compactness of κ. In a delightful argument, Laver [L78] proved that ...
Joel David Hamkins, Saharon Shelah
INFOCOM
2010
IEEE
13 years 5 months ago
A Framework for Joint Network Coding and Transmission Rate Control in Wireless Networks
—Network coding has been proposed as a technique that can potentially increase the transport capacity of a wireless network via processing and mixing of data packets at intermedi...
Tae-Suk Kim, Serdar Vural, Ioannis Broustis, Dimit...
MMMACNS
2010
Springer
13 years 5 months ago
Group-Centric Models for Secure and Agile Information Sharing
Abstract. To share information and retain control (share-but-protect) is a classic cyber security problem for which effective solutions continue to be elusive. Where the patterns o...
Ravi S. Sandhu, Ram Krishnan, Jianwei Niu, William...