Sciweavers

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
2007
79views more  IPL 2007»
13 years 11 months ago
Analysis of noise-induced phase synchronization in nervous systems: from algorithmic perspective
In many cases, a key step in neuronal information processing is phase synchronization of neurons (as oscillators). Substantial evidence suggests that an universal mechanism is beh...
Dawei Hong
IPL
2007
60views more  IPL 2007»
13 years 11 months ago
Robustness of PSPACE-complete sets
We study the robustness of complete languages in PSPACE and prove that they are robust against P-selective sparse sets. Earlier similar results are known for EXPcomplete sets [3] ...
Aduri Pavan, Fengming Wang
IPL
2007
75views more  IPL 2007»
13 years 11 months ago
New length bounds for cycle bases
Michael Elkin, Christian Liebchen, Romeo Rizzi
IPL
2007
96views more  IPL 2007»
13 years 11 months ago
On constructing an optimal consensus clustering from multiple clusterings
Computing a suitable measure of consensus among several clusterings on the same data is an important problem that arises in several areas such as computational biology and data mi...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie...
IPL
2007
121views more  IPL 2007»
13 years 11 months ago
Parameterized complexity of the induced subgraph problem in directed graphs
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...
Venkatesh Raman, Somnath Sikdar
IPL
2007
105views more  IPL 2007»
13 years 11 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk