Sciweavers

1932 search results - page 327 / 387
» A Functional Quantum Programming Language
Sort
View
ICALP
2007
Springer
15 years 10 months ago
Complexity of Propositional Proofs Under a Promise
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
Nachum Dershowitz, Iddo Tzameret
ICALP
2007
Springer
15 years 10 months ago
Parameterized Approximability of the Disjoint Cycle Problem
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
Martin Grohe, Magdalena Grüber
ICALP
2007
Springer
15 years 10 months ago
Private Locally Decodable Codes
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
Rafail Ostrovsky, Omkant Pandey, Amit Sahai
IFIP
2007
Springer
15 years 10 months ago
Insider Threat Analysis Using Information-Centric Modeling
Capability acquisition graphs (CAGs) provide a powerful framework for modeling insider threats, network attacks and system vulnerabilities. However, CAG-based security modeling sys...
Duc T. Ha, Shambhu J. Upadhyaya, Hung Q. Ngo, S. P...
IFIP
2007
Springer
15 years 10 months ago
Towards UML-Intensive Framework for Model-Driven Development
The paper describes a conceptual framework for model-driven development based on concise application of UML and modeling tool functionality. A case study of modeling software for l...
Darius Silingas, Ruslanas Vitiutinas