14704 search results - page 2880 / 2941 » computer 2007 |
AMR
2007
Springer
14 years 4 months ago
2007
Springer
This paper is a critical analysis of the use of ontology as an instrument to specify the semantics of a document. The paper argue that not only is a logic of the type used in ontol...
APPROX
2007
Springer
14 years 4 months ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
APPROX
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
APPROX
2007
Springer
14 years 4 months ago
2007
Springer
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
ASIACRYPT
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Whereas encryption schemes withstanding passive chosenplaintext attacks (CPA) can be constructed based on a variety of computational assumptions, only a few assumptions a...