IPL
2008
13 years 3 months ago
2008
IPL
2008
13 years 4 months ago
2008
The Polar Diagram [1] of a set of points (i.e. sites) is a partition of the plane. It is a locus approach for problems processing angles. Also, Dynamic Polar Diagram problem is a ...
IPL
2008
13 years 4 months ago
2008
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p 1, comp...
IPL
2007
13 years 4 months ago
2007
Abstract. The intention of this note is to motivate the researchers to study Hadwiger’s conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G...
IPL
2007
13 years 4 months ago
2007
We present a simple and fast deterministic solution to the string matching with don’t cares problem. The task is to determine all positions in a text where a pattern occurs, all...
IPL
2007
13 years 4 months ago
2007
The Euclidean distance transform of a binary image is the function that assigns to every pixel the Euclidean distance to the background. The Euclidean feature transform is the fun...
IPL
2006
13 years 5 months ago
2006
IPL
2006
13 years 5 months ago
2006
In this paper we investigate P systems whose compartments contain sets of symbolobjects rather than multisets of objects, as it is common in membrane computing. If the number of m...
IPL
2006
13 years 5 months ago
2006
Valiant (1979) proved that every polynomial of formula size e is a projection of the (e + 2)
IPL
2006
13 years 5 months ago
2006
