Sciweavers

IPL
2008
85views more  IPL 2008»
13 years 10 months ago
An impossibility about failure detectors in the iterated immediate snapshot model
Sergio Rajsbaum, Michel Raynal, Corentin Travers
IPL
2008
97views more  IPL 2008»
13 years 11 months ago
Dynamic polar diagram
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 ...
Bahram Sadeghi Bigham, Ali Mohades, Lidia M. Orteg...
IPL
2008
111views more  IPL 2008»
13 years 11 months ago
Flying over a polyhedral terrain
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...
Hamid Zarrabi-Zadeh
IPL
2007
94views more  IPL 2007»
13 years 11 months ago
A note on the Hadwiger number of circular arc graphs
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...
N. S. Narayanaswamy, Naveen Belkale, L. Sunil Chan...
IPL
2007
91views more  IPL 2007»
13 years 11 months ago
Simple deterministic wildcard matching
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...
Peter Clifford, Raphaël Clifford
IPL
2007
104views more  IPL 2007»
13 years 11 months ago
A linear-time algorithm for Euclidean feature transform sets
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...
Wim H. Hesselink
IPL
2006
87views more  IPL 2006»
14 years 20 hour ago
Implementing unreliable failure detectors with unknown membership
Ernesto Jiménez, Sergio Arévalo, Ant...
IPL
2006
117views more  IPL 2006»
14 years 20 hour ago
P systems without multiplicities of symbol-objects
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...
Artiom Alhazov
IPL
2006
88views more  IPL 2006»
14 years 20 hour ago
Improved construction for universality of determinant and permanent
Valiant (1979) proved that every polynomial of formula size e is a projection of the (e + 2)
Hong Liu, Kenneth W. Regan
IPL
2006
77views more  IPL 2006»
14 years 20 hour ago
Flow equivalent trees in undirected node-edge-capacitated planar graphs
Xianchao Zhang, Weifa Liang, He Jiang