Showing papers in "Journal of Discrete Algorithms in 2003"

TL;DR: An O(2.270k + n) time algorithm is given for 3-Hitting Set, which is efficient for small values of k, a typical occurrence in some applications.

TL;DR: In this article, the authors consider a distributed colouring game played on a simple connected graph, where each vertex is coloured black or white; at each round, each vertex simultaneously recolours itself by the colour of the simple (strong) majority of its neighbours.

TL;DR: This paper shows efficient methods of answering various queries on fingerprint statistics by preprocessing the problem of fingerprinting text by sets of symbols in time O(|Σ|logn).

TL;DR: The problem of finding a consensus string based on consensus error is NP-complete when the penalty matrix is a metric.

TL;DR: In this paper, the authors show how to determine whether a given pattern p of length m occurs in a given text t of length n in O(n+√m) time (where O allows for logarithmic factors in m and n/m).

TL;DR: The modular approach followed in this paper can be used to solve other problems in asynchronous systems experiencing Byzantine failures and is based on two underlying failure detection modules based on a reliable Byzantine behaviour detection module.

TL;DR: An automaton is built that accepts all subsequences of given texts and an upper bound for its number of states is proved, which is called the Directed Acyclic Subsequence Graph (DASG).

TL;DR: The first nontrivial algorithm for approximate pattern matching on compressed text in the Ziv-Lempel family is presented and a practical speedup over the basic approach of up to 2X for moderate m and small k is shown.

TL;DR: The experimental results show that the compressed search algorithm needs half the time necessary for decompression plus searching, which is currently the only alternative.

TL;DR: The potential of suitably adapted binary search trees as competitors in this context is investigated, and emirical evidence, illustrating the competitiveness of suffix BSTs, is presented.

TL;DR: This work says a family W of strings is an UMFF if every string has a unique maximal factorization over W, and shows a large class of B-like UMFF.

TL;DR: In this paper, the authors investigated the efficiency of fault-tolerant cooperative computation using group communication service (GCS) in the setting where dynamic changes in the underlying network topology cause the processor groups to change over time.

TL;DR: A polynomial time approximation scheme for the problem of finding a sparsest 2-spanner of a 4-connected planar triangulation is presented.

TL;DR: All scenarios with linear complexity in a tree topology are dealt with, and exact tight bounds for the bit and message complexities are proved.

TL;DR: It is shown that approximate min-wise independence allows similar uses, by presenting a derandomization of the RNC algorithm for approximate set cover due to S. Rajagopalan and V. Vazirani.

TL;DR: This algorithm combines quantum searching algorithms with a technique from parallel string matching, called Deterministic Sampling, to determine whether a given pattern p of length m occurs in a given text t in O(√n+√m) time with inverse polynomial failure probability.

TL;DR: It is proved that the problem to minimize the diameter of a spanning subgraph S subject to the constraint that the total cost of the edges in S does not exceed a given budget is nonapproximable.

TL;DR: This paper investigates those games, called update games, in which each configuration occurs an infinite number of times during a two- person play, and presents an efficient polynomial-time algorithm for deciding if a graph is an update network.

TL;DR: An algorithmic approach is described for showing that if there is an odd perfect number then it has t distinct prime factors, and its application towards showing that t ≥ 9 is described.

TL;DR: This work introduces, characterize, and provides algorithmic results for (k, +)-distance-hereditary graphs, k ≥ 0.5, which can be used to model interconnection networks with desirable connectivity properties.

TL;DR: In this article, the authors propose an analysis des transformations du champ antiraciste en France depuis le milieu des annees 1980, en mettant l'accent sur la position of l'association SOS-Racisme dans l’evolution d'un antiracismet "moral" vers la lutte contre la discrimination "raciale" in France.

TL;DR: In this paper, the authors analyse the processus de construction and de formation continuelle of l'identite reunionnaise en tenant compte des changements socio-culturels, economiques and politiques qui ont eu cours des origines a aujourd’hui.

TL;DR: In this paper, the ONG vehiculent bien des modeles alternatifs, comme dans le passe, and jouent aussi un role pedagogique central dans la diffusion des normes et valeurs occidentales dans les autres societes.

TL;DR: This work introduces a O(α2mn + α4(m + n) algorithm for dating such a sample sequence against an error-free master sequence, where n and m are the lengths of the sequences.

TL;DR: A theory of confluence is used to show that, in many cases, all maximal reduction sequences are equivalent, gaining insights into the design of reduction algorithms that obtain a maximum degree of reduction.

TL;DR: A new method is presented to compute the combinatorial shift function ("matching shift") of the well-known Boyer-Moore string matching algorithm that avoids extra preprocessing together with a tight bound of 1.5n character comparisons.

TL;DR: The procession traditionnelle des mineurs de Potosi (Andes boliviennes) s’est transformee en festivite folklorique ou defilent des fraternites de danseurs inspirees par le theâtre religieux de la colonie and la culture paysanne des hauts‑plateaux as mentioned in this paper.

TL;DR: The authors propose quelques hypotheses on the genese du champ humanitaire en Occident, en s’appuyant notamment sur les travaux of K.Polanyi, G.Konrad and I.Szelenyi.

TL;DR: Les ONG, qui jouent un role croissant en Afrique en matiere de developpement rural, definissent leur action en termes d'appui aux initiatives locales, notamment dans le cadre d'un "partenariat" avec les associations paysannes.

TL;DR: In this paper, Saad ad-Din Ibrahim montre les limites de la democratisation par la societe civile, i.e., the politiques de democratisation n’ont pas pour but de conduire a la democratie mais de satisfaire l'opinion internationale (notamment les bailleurs de fonds) and d'accroitre la stabilite du regime.