IPL
2008
14 years 13 days ago
2008
A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a do...
IPL
2008
14 years 13 days ago
2008
IPL
2008
14 years 13 days ago
2008
The Chernoff-Hoeffding bounds are fundamental probabilistic tools. An elementary approach is presented to obtain a Chernoff-type upper-tail bound for the number of prime factors o...
IPL
2008
14 years 13 days ago
2008
: Reference Counting is the memory management technique of most widespread use today. Very often applications handle objects that are either permanent or get tenured. This paper us...
IPL
2008
14 years 13 days ago
2008
This paper studies the equational theory of prebisimilarity, a bisimulation-based preorder introduced by Hennessy and Milner in the early 1980s, over basic CCS with the divergent ...
IPL
2008
14 years 13 days ago
2008
Abstract. In this paper, we study a restricted version of the position restricted pattern matching problem introduced and studied M
IPL
2008
14 years 13 days ago
2008
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
IPL
2008
14 years 13 days ago
2008
IPL
2008
14 years 13 days ago
2008
The problem of biclustering consists of the simultaneous clustering of rows and columns of a matrix such that each of the submatrices induced by a pair of row and column clusters ...
IPL
2008
14 years 13 days ago
2008
