4340 search results - page 643 / 868 » Formal Methods and Cryptography |
281
click to vote
SIAMCOMP
2011
14 years 9 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
221
click to vote
SIAMCOMP
2011
14 years 9 months ago
2011
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [10]. We give a property tester that given a graph with degree bound d, an ex...
209
click to vote
AIME
2011
Springer
14 years 6 months ago
2011
Springer
This paper describes a novel methodological approach to identifying inconsistencies when concurrently using multiple clinical practice guidelines. We discuss how to construct a for...
223
click to vote
AIME
2011
Springer
14 years 6 months ago
2011
Springer
Representing the Foundational Model of Anatomy (FMA) in OWL 2 is essential for semantic interoperability. The paper describes the method and tool used to formalize the FMA in OWL 2...
203
click to vote
APLAS
2011
ACM
14 years 6 months ago
2011
ACM
Modern multi-core microprocessors implement weak memory consistency models; programming for these architectures is a challenge. This paper solves a problem open for ten years, and ...