4880 search results - page 405 / 976 » Manuals as Structured Programs |
212
click to vote
ECCV
2000
Springer
16 years 9 months ago
2000
Springer
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...
185
click to vote
FOSSACS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Separation logic is a recent extension of Hoare logic for reasoning about programs with references to shared mutable data structures. In this paper, we provide a new inte...
156
click to vote
ICALP
2010
Springer
16 years 2 hour ago
2010
Springer
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...
184
click to vote
VLDB
1987
ACM
15 years 10 months ago
1987
ACM
A Datalog program can be translated into a system of fixpoint equations of relational algebra; this paper studies how such a system can be solved and optimized for a particular qu...
312
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
Deadlock in multithreaded programs is an increasingly important problem as ubiquitous multicore architectures force parallelization upon an ever wider range of software. This pape...