Sciweavers

4052 search results - page 404 / 811
» Using RDF to describe networks
Sort
View
NDSS
2009
IEEE
16 years 1 months ago
CSAR: A Practical and Provable Technique to Make Randomized Systems Accountable
We describe CSAR, a novel technique for generating cryptographically strong, accountable randomness. Using CSAR, we can generate a pseudo-random sequence and a proof that the elem...
Michael Backes, Peter Druschel, Andreas Haeberlen,...
HYBRID
2003
Springer
16 years 2 days ago
Automated Symbolic Reachability Analysis; with Application to Delta-Notch Signaling Automata
Abstract. This paper describes the implementation of predicate abstraction techniques to automatically compute symbolic backward reachable sets of high dimensional piecewise affine...
Ronojoy Ghosh, Ashish Tiwari, Claire Tomlin
AINA
2010
IEEE
15 years 12 months ago
Extracting Named Entities and Synonyms from Wikipedia
—In many search domains, both contents and searches are frequently tied to named entities such as a person, a company or similar. An example of such a domain is a news archive. O...
Christian Bohn, Kjetil Nørvåg
NDSS
1998
IEEE
15 years 11 months ago
On the Problem of Trust in Mobile Agent Systems
Systems that support mobile agents are increasingly being used on the global Internet. Security concerns dealing with the protection of the execution environment from malicious ag...
Uwe G. Wilhelm, Sebastian Staamann, Levente Butty&...
FODO
1993
Springer
147views Algorithms» more  FODO 1993»
15 years 11 months ago
Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm
Abstract. DDH extends the idea of dynamic hashing algorithms to distributed systems. DDH spreads data across multiple servers in a network using a novel autonomous location discove...
Robert Devine