36781 search results - page 10 / 7357 » Parameterizing by the Number of Numbers |
JDA
2007
13 years 7 months ago
2007
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...
IPL
2010
13 years 2 months ago
2010
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
DSN
2005
IEEE
14 years 1 months ago
2005
IEEE
— We present the first protocol that reaches asynchronous Byzantine consensus in two communication steps in the common case. We prove that our protocol is optimal in terms of bo...
ICPP
1999
IEEE
13 years 12 months ago
1999
IEEE
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...