93 search results - page 12 / 19 » What Makes the Arc-Preserving Subsequence Problem Hard |
CRYPTO
2006
Springer
13 years 11 months ago
2006
Springer
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
DRM
2006
Springer
13 years 11 months ago
2006
Springer
One of the most fundamental problems in computer security is protecting sensitive digital information from unauthorized disclosure. There are a number of challenges, such as spywa...
SEMWEB
2007
Springer
14 years 1 months ago
2007
Springer
Only few well-maintained domain ontologies can be found on the Web. The likely reasons for the lack of useful domain ontologies include that (1) informal means to convey intended m...
SASN
2006
ACM
14 years 1 months ago
2006
ACM
Intrusion or misbehaviour detection systems are an important and widely accepted security tool in computer and wireless sensor networks. Their aim is to detect misbehaving or faul...
ATAL
2007
Springer
14 years 1 months ago
2007
Springer
Determining the provenance of data, i.e. the process that led to that data, is vital in many disciplines. For example, in science, the process that produced a given result must be...