Showing papers in "Information Processing Letters in 2003"

TL;DR: The particle swarm optimization algorithm is analyzed using standard results from the dynamic system theory and graphical parameter selection guidelines are derived, resulting in results superior to previously published results.

TL;DR: It is proved that the optimal lumping quotient of a finite Markov chain can be constructed in O(mlg n) time, where n is the number of states and m is theNumber of transitions.

TL;DR: A combined use of the projections on and the distances to the DLSI spaces introduced from the differential document vectors improves the adaptability of the LSI (latent semantic indexing) method by capturing unique characteristics of documents.

TL;DR: This work focuses on collections of linear functions and several classes of convex, piecewise linear functions which are defined by location models and presents simple linear programming formulations for these optimization models which give rise to linear time algorithms when the dimension d is fixed.

TL;DR: A linear time approximation algorithm with a performance ratio of 1/2 for finding a maximum weight matching in an arbitrary graph which is much simpler than the one given by Preis and needs no amortized analysis for its running time.

TL;DR: An overview of some 30 years of study of the software evolution phenomenon, including the SPE program classification, a principle of software uncertainty and laws of E-type software evolution, providing a basis for the formation of a theory of software evolution.

TL;DR: An O(rn2m2) time algorithm based upon the dynamic programming technique is proposed for this new problem, where n, m and r are lengths of S1, S2 and P, respectively.

TL;DR: A linear-time algorithm is given for the k-tuple domination problem in strongly chordal graphs, which is a subclass of chordal graph and includes trees, block graphs, interval graphs and directed path graphs, and it is proved that the problem is NP-complete for split graphs and for bipartite graphs.

TL;DR: It is shown that every edge of Qn - E' lies on a cycle of every even length from 4 to |V(G)| inclusive where E' is a subset of E(Qn) with |E'| ≤ n - 2.

TL;DR: A reversible transformation on strings (BWT) that arouses considerable interest and curiosity in the field of Data Compression produces a permutation BWT(w) of an input string w that is easier to compress than the original one.

TL;DR: This work considers cuckoo hashing as proposed by Pagh and Rodler in 2001 and shows that the expected construction time of the hash table is O( n ) as long as the two open addressing tables are each of size at least (1 + e) n.

TL;DR: In this paper, it was shown that the fraction of subsets that are c.u.p. is negligibly small, and the sharpened version of the NFL theorem holds for any subset F of the set of all possible functions if and only if F is closed under permutation.

TL;DR: It is shown that the independent set problem is polynomial-time solvable in the class of (Pk, K1,n)-free graphs for any positive integers k and n, thereby generalizing several known results.

TL;DR: It is shown that a cycle of length l, for any 4 ≤ l ≤ |V(CQn)| - fv, can be embedded into a wounded crossed cube as long as the total number of faults is no more than n - 2, and it is said that CQn is (n - 2)-fault-tolerant pancyclic.

TL;DR: A relatively simple though very efficient way to color the d-dimensional grid G(n1,n2,...,nd) (with ni vertices in each dimension 1 ≤ i ≤ d), for two different types of vertex colorings: acyclic and k-distance coloring of graphs.

TL;DR: The scheduling problem with deteriorating jobs to minimize the makespan on a single machine where the facility has an availability constraint is studied in this paper.

TL;DR: A linear time recognition algorithm for proper interval graphs based on certain ordering of vertices, called bicompatible elimination ordering (BCO), and a linear time algorithm to construct a Hamiltonian cycle of G.

TL;DR: It is shown that for every uniform consensus algorithm tolerating t failures, and for every f ≤ t - 2, there is an execution with f failures that requires f + 2 rounds.

TL;DR: The generalization of covering problems such as the set cover problem to partial covering problems, where one only wants to cover a given number k of elements rather than all elements, is studied.

TL;DR: A new, simpler algorithm for finding a proper k-edge-coloring of any bipartite multigraph G with n vertices and m edges is described, that runs in time O(m logm) as well.

TL;DR: Two new self-stabilizing distributed algorithms for proper Δ + 1 (Δ is the maximum degree of a mode in the graph) colorings of arbitrary system graphs are proposed.

TL;DR: This paper proposes two efficient proxy signature schemes based on the factoring problem, which combine the RSA signature scheme and the Guillou-Quisquater signature scheme, and proposes a proxy-protected signature scheme with anonymous proxy signers.

TL;DR: A general probabilistic framework applicable to any search algorithm and whose net effect is to reduce the search radius is presented, which illustrates empirically its practical performance on a particular class of algorithms, where large improvements in the search time are obtained at the cost of a very small error probability.

TL;DR: This paper presents a technique for efficient extraction of concise and accurate schemas for XML documents by restricting the schema form and applying some heuristic rules, which achieves the efficiency and conciseness.

TL;DR: Simple combinatorial algorithms are presented that achieve an approximation ratio bounded by the length, in terms of number of arcs, of a longest simple cycle of the digraph.

TL;DR: This paper implemented the algorithms and present empirical results in order to show their superiority over other algorithms for computing hitting sets, including the new BHS-tree and Boolean algebraic algorithms.

TL;DR: It is shown that the problem of finding a minimum-link watchman route is NP-complete, even if the holes are all convex, and a provably good approximation algorithm is provided that achieves an approximation factor of O(log n).

TL;DR: In this paper, a simple algorithm for computing the Time Voronoi Diagram, that is, the Voronoa Diagram of a set of points using the time distance is given.