We consider the problem of approximating a family of isocontours in a sensor field with a topologically-equivalent family of simple polygons. Our algorithm is simple and distribu...
J. Raymundo Marcial–Romero and M. H. Escard´o described onal programming language with an abstract data type Real for the real numbers and a non-deterministic operator rtest: Re...
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...
Takehiro Ito, Erik D. Demaine, Xiao Zhou, Takao Ni...
—In this paper, we propose a technique to reduce the number of trellis states in BCJR-type algorithms, i.e., algorithms with a structure similar to that of the well-known algorit...
Giulio Colavolpe, Gian Luigi Ferrari, Riccardo Rah...
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...