Triangulating a Nonconvex Polytope.
In this paper we present experimental results for string matching algorithms which have a competitive theoretical worst case run time complexity. Of these algorithms a few are already famous for their speed in practice, such as the Boyer–Moore and its derivatives. We chose to evaluate the algorithms by counting the number of comparisons made and by timing how long they took to complete a given search. Using the experimental results we were able to introduce a new string matching algorithm and compared...
This paper presents two extensions of the second order polymorphic lambda calculus, system F, with monotone (co)inductive types supporting (co)iteration, primitive (co)recursion and inversion principles as primitives. One extension is inspired by the usual categorical approach to programming by means of initial algebras and final coalgebras; whereas the other models dialgebras, and can be seen as an extension of Hagino's categorical lambda calculus within the framework of parametric polymorphism....
This article presents two simple deterministic algorithms for finding the Minimum Spanning Tree in time for any non-trivial class of graphs closed on graph minors. This applies in particular to planar graphs and graphs of bounded genus. Both algorithms run on a pointer machine and they require no a priori knowledge of the structure of the class except for its density. Edge weights are only compared.
In this paper we describe two methods for optical flow estimation between two images. Both methods are based on the backward tracking of characteristics for advection equation and the difference is on the choice of advection vector field. We present numerical experiments on 2D data of cell nucleus.
In this paper we study two operations of merging components in a chain graph, which appear to be elementary operations yielding an equivalent graph in the respective sense. At first, we recall basic results on the operation of feasible merging components, which is related to classic LWF (Lauritzen, Wermuth and Frydenberg) Markov equivalence of chain graphs. These results are used to get a graphical characterisation of factorisation equivalence of classic chain graphs. As another example of the use...
We introduce natural generalizations of two well-known dynamical systems, the Sand Piles Model and the Brylawski's model. We describe their order structure, their reachable configuration's characterization, their fixed points and their maximal and minimal length's chains. Finally, we present an induced model generating the set of unimodal sequences which amongst other corollaries, implies that this set is equipped with a lattice structure.
In this work we study some properties of the twofold integral and, in particular, its relation with the 2-step Choquet integral. First, we prove that the Sugeno integral can be represented as a 2-step Choquet integral. Then, we turn into the twofold integral studying some of its properties, establishing relationships between this integral and the Choquet and Sugeno ones and proving that it can be represented in terms of 2-step Choquet integral.