3690 search results - page 452 / 738 » Computation with classical sequents |
153
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
172
click to vote
RTA
2009
Springer
16 years 1 months ago
2009
Springer
We address the problem of cyclic termgraph rewriting. We propose a new framework where rewrite rules are tuples of the form (L, R, τ, σ) such that L and R are termgraphs represen...
171
click to vote
SCALESPACE
2009
Springer
16 years 1 months ago
2009
Springer
In the context of shape and image modeling by manifold learning, we focus on the problem of denoising. A set of shapes or images being known through given samples, we capture its s...
204
click to vote
SCALESPACE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Segmentation of images is often posed as a variational problem. As such, it is solved by formulating an energy functional depending on a contour and other image derived t...
179
click to vote
TLCA
2009
Springer
16 years 1 months ago
2009
Springer
Finiteness spaces constitute a categorical model of Linear Logic whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefsc...