1998 search results - page 336 / 400 » Complexity of the Cover Polynomial |
CONCUR
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. This paper presents SOAR: the first oblivious atomicity assertion with polynomial complexity. SOAR enables to check atomicity of a single-writer multi-reader register imp...
ESWS
2008
Springer
13 years 11 months ago
2008
Springer
To support the reuse and combination of ontologies in Semantic Web applications, it is often necessary to obtain smaller ontologies from existing larger ontologies. In particular, ...
EWCBR
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
ICISC
2007
13 years 11 months ago
2007
Pairing based cryptography is a new public key cryptographic scheme. An elliptic curve suitable for pairing based cryptography is called a “pairing-friendly” elliptic curve. Af...
KRMED
2008
13 years 11 months ago
2008
By constructing local extensions to SNOMED we aim to enrich existing medical and related data stores, simplify the expression of complex queries, and establish a foundation for se...