1153 search results - page 179 / 231 » Reversing graph transformations |
115
Voted
CSL
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
136
Voted
RE
2006
Springer
15 years 21 days ago
2006
Springer
Aspect-oriented concepts are currently introduced in all phases of the software development life cycle. However, the complexity of interactions among different aspects and between...
86
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
This paper addresses the problem of exactly inferring the maximum a posteriori solutions of discrete multi-label MRFs or CRFs with higher order cliques. We present a framework to ...
112
Voted
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
123
Voted
DM
2006
15 years 24 days ago
2006
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...