2477 search results - page 145 / 496 » Approximate extended formulations |
191
click to vote
LPAR
2007
Springer
15 years 10 months ago
2007
Springer
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof...
137
click to vote
ISVC
2005
Springer
15 years 10 months ago
2005
Springer
In this paper we explicitly derive a level set formulation for mean curvature flow in a Riemannian metric space. This extends the traditional geodesic active contour framework whi...
126
click to vote
TSD
2005
Springer
15 years 10 months ago
2005
Springer
The aim of the work described in this paper is to extend the EPFL dialogue platform with multimodal capabilities. Based on our experience with the EPFL Rapid Dialogue Prototyping M...
130
click to vote
ECOOP
2004
Springer
15 years 9 months ago
2004
Springer
The expression problem (aka the extensibility problem) refers to a fundamental dilemma of programming: Can your application be structured in such a way that both the data model and...
123
click to vote
FORMATS
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. This paper presents a model-checking approach for analyzing discrete-time Markov reward models. For this purpose, the temporal logic probabilistic CTL is extended with re...