We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...
Christian Roed Pedersen, Lars Relund Nielsen, Kim ...
Abstract. We study hierachical segmentation in the framework of edgeweighted graphs. We define ultrametric watersheds as topological watersheds null on the minima. We prove that th...
—We design an intuitionistic predicate logic that supports a limited amount of classical reasoning, just enough to prove a variant of Markov’s principle suited for predicate lo...
We define a generalized distance function on an unoriented 3D point set and describe how it may be used to reconstruct a surface approximating these points. This distance function...
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...