Sciweavers

679 search results - page 84 / 136
» Using decision problems in public key cryptography
Sort
View
ICLP
2005
Springer
15 years 6 months ago
OWL: A Description Logic Based Ontology Language
Abstract Description Logics (DLs) are a family of class (concept) based knowledge representation formalisms. They are characterised by the use of various constructors to build comp...
Ian Horrocks
ENTCS
2006
134views more  ENTCS 2006»
15 years 1 months ago
Partial Order Reduction for Probabilistic Branching Time
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
Christel Baier, Pedro R. D'Argenio, Marcus Grö...
ESOP
2003
Springer
15 years 6 months ago
On the Secure Implementation of Security Protocols
We consider the problem of implementing a security protocol in such a manner that secrecy of sensitive data is not jeopardized. Implementation is assumed to take place in the cont...
Pablo Giambiagi, Mads Dam
C3S2E
2009
ACM
15 years 7 months ago
Radius selection algorithms for sphere decoding
The integer least squares problem arises from many applications such as communications, cryptography, and GPS. In this paper, we consider the sphere decoding method in communicati...
Fei Zhao, Sanzheng Qiao
GLOBECOM
2007
IEEE
15 years 7 months ago
Heuristics for the Design and Optimization of Streaming Content Distribution Networks
Abstract— The design of efficient and scalable streaming Content Distribution Networks (CDNs) is an open problem of great economic interest. A key decision is the number of repl...
Sandjai Bhulai, Robert D. van der Mei, Mengxiao Wu