Showing papers in "Information Processing Letters in 2002"

TL;DR: In this paper, a constructive version of Hausdorff dimension is proposed to assign to every sequence A ∈ C a constructive dimension dim(A) ∈ [0, 1], where A is a sequence A is random if and only if there is a constant c such that

TL;DR: The conclusion is that super-linear performance is possible for PEAs, theoretically and in practice, both in homogeneous and in heterogeneous parallel machines.

TL;DR: This paper examines one distance measure used in a clustering application in computational genetics, and shows how to efficiently compute the distance, and how this defines a new class of perfect graphs.

TL;DR: This article shows that reachability, termination and a few other verification problems are decidable for lossy channel systems but cannot be solved in primitive recursive time.

TL;DR: This work considers the problem of scheduling periodic task systems on multiprocessors and presents a deadline-based scheduling algorithm that successfully schedules on m processors any periodic task system with utilization at most m2/(2m - 1).

TL;DR: An FPTAS with an improved running time of O(mn/e) for acyclic graphs, where m and n denote the number of edges and nodes in the graph, and the novelty of the algorithm lies in its "adaptivity".

TL;DR: A new polynomially solvable case for the problem in bipartite graphs which deals with a generalization of bi-complement reducible graphs is described.

TL;DR: The paper deals with a single machine problem of scheduling jobs with start time dependent processing times to minimize the total weighted completion time and proves that the problem is NP-hard.

TL;DR: It is proved that there exists a hamiltonian path in Qn - F between any two vertices in the partite set without υ, and all bounds are tight.

TL;DR: This paper overviews the recent developments in learning classifier systems research, the new models, and the most interesting applications, suggesting some of the most relevant future research directions.

TL;DR: A comparison between the problems with job processing times being decreasing and increasing linear functions of their start times is presented, which shows that the decreasing and increase linear models of job processing time seem to be closely related to each other.

TL;DR: This paper suggests key-collision attacks, which show that the theoretic strength of a block cipher (in ECB mode) cannot exceed the square root of the size of the key space.

TL;DR: A (2 + ɛ)-approximation algorithm is provided for the time-dependent orienteering problem which runs in polynomial time if the ratio between the maximum and minimum traveling time between any two sites is constant.

TL;DR: These approximation algorithms transform the terrain guarding instance into a MINIMUM SET COVER instance, which is then solved by the standard greedy approximation algorithm, which achieves approximation ratios of O(logn), where n is the number of vertices in the input terrain.

TL;DR: An adaptive algorithm that can adjust parameters of a genetic algorithm according to the observed performance is presented and it is shown that the proposed method offers two advantages over the other competing methods: the reliability in finding the optimal solution and the time required for finding the ideal solution.

TL;DR: The ideal case of formal languages: many subclasses of regular languages (like star-free languages or locally threshold testable languages) can be exactly described through fragments of the whole logics, like first-order logics or linear temporal logics.

TL;DR: In this paper, the authors investigated a variant of the Steiner tree problem, where every target vertex is required to be a leaf vertex in the solution Steiner Tree, and presented hardness results for this variant as well as a polynomial time approximation algorithm with performance ratio ρ + 2.

TL;DR: This paper shows that the n-dimensional Mobius cube Mn is Hamilton-connected when n ≥ 3, and shows that any cycle of length l can be embedded into Mn with dilation 1 (n ≥ 2).

TL;DR: This paper gives a simple algorithm to generate all rooted plane trees with at most n vertices that uses O(n) space and generates such trees in O(1) time per tree without duplications.

TL;DR: An exercise in proof design is presented, demonstrating the correctness of an algorithm for computing the longest path in a tree by isolating the relevant concepts for the problem at hand, introducing special-purpose notation for them that is geared to manipulation and to crisp formal specification, and then solving the problem in a demand-driven way.

TL;DR: The greedy algorithm introduced by Krumke and Wirth for the minimum label spanning tree problem is shown to be a (ln(n - 1) + 1)-approximation for any graph with n nodes, which improves the known performance guarantee 2 ln n + 1.

TL;DR: In this article, it was shown that the parameterized problem PERFECT CODE belongs to W[1] and W[2], and that WEIGHTED EXACT CNF SATISFIABILITY is a natural problem.

TL;DR: The security of public key signature schemes in a "multi-user" setting is addressed and the concrete security of this general reduction for certain specific discrete logarithm based signature algorithms such as that of Schnorr is improved.

TL;DR: A fast correlation attack on the recently proposed stream cipher LILI-128 is demonstrated, which has complexity around 271 bit operations assuming a received sequence of length around 230 bits and a precomputation phase of complexity 279 table lookups.

TL;DR: The performance of the IHP algorithm was evaluated for various cases and compared with those of two well-known mining algorithms, Apriori algorithm and Direct Hashing and Pruning algorithm.

TL;DR: A simple O(|X|l + |Y|k) time algorithm that computes X and Y, two run-length encoded strings, of encoded lengths k and l, respectively.

TL;DR: A framework for minimum spanning tree construction is established which is based on a general concept of spanning graphs and an O(nlogn) sweep-line algorithm is designed to construct a rectilinearminimum spanning tree without using Delaunay triangulation.

TL;DR: It is shown that the Maximum Weight Stable Set (MWS) Problem can be solved in polynomial time when restricted to claw-free graphs and the structure of graphs being both claw- free and co-claw-free is very simple which implies bounded clique width for this graph class.