Showing papers in "Information Processing Letters in 2008"

TL;DR: It is shown that Bloom's analysis is incorrect and give a correct analysis of randomized data structure for membership queries dating back to 1970.

TL;DR: Two optimal linear-time algorithms for computing the Longest Previous Factor (LPF) array corresponding to a string w are given and several properties and applications of LPF are investigated.

TL;DR: A variation of the greedy algorithm is used to produce a ((2e-1)( e-1)[email protected])-approximation for every @e>0, and then partial enumeration to reduce the approximation ratio to e(e- 1)[email-protected]

TL;DR: In this article, the authors investigate the global scheduling of sporadic, implicit deadline, real-time task systems on multiprocessor platforms and prove that the time complexity of the feasibility problem is linear relatively to the number of (sporadic) tasks for a fixed number of processors.

TL;DR: To design an efficient algorithm which, for a given graph on n vertices, outputs a t-spanner whose size is of the order of the maximum size of the sparsest tspanner of a graph onn vertices.

TL;DR: This paper determines that the super connectivity of AQ"n is 4n-8 for n>=6 and the super edge-connectivity is 4 n-4 for n >=5, which can provide more accurate measurements for reliability and fault tolerance of the system.

TL;DR: A new setting about social coefficient is proposed by introducing an explicit selection pressure, in which each particle decides its search direction toward the personal memory or swarm memory, and a mutation strategy is designed to avoid premature convergence.

TL;DR: It is proved that polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs are O(1@rn^2mlogn) for graphs with n nodes and m edges.

TL;DR: A new compact Hilbert index is defined which, while maintaining all of the advantages of the standard Hilbert curve, permits spaces with unequal dimension cardinalities.

TL;DR: The problem of finding a spanning tree with few leaves is motivated by the design of communication networks, where the cost of the devices depends on their routing functionality (ending, forwarding, or routing a connection), so instead of minimizing the number of leaves, the solution is to deal with maximizing theNumber of non-leaves.

TL;DR: It is shown that there is no FPT algorithm for g(k) of the form k+c (where c is a fixed constant, termed an additive FPT approximation), unless FPT=W[2].

TL;DR: Constraints sufficient to eliminate (nontrivial) inferences in relational databases are investigated with the objective of replacing controlled query evaluation by access control mechanisms under preservation of confidentiality.

TL;DR: An improved PSO algorithm (IPSO) based on the ldquoall differentrdquo constraint is proposed to solve the flowshop scheduling problem with the objective of minimizing makespan and can be used to solve large scale flow shop scheduling problem effectively.

TL;DR: The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied.

TL;DR: This paper presents an efficient algorithm for the traditional LCS problem and a recent variant of it, namely the constrained LCS (CLCS) problem, where the computed LCS must also be a supersequence of a third given string.

TL;DR: It is proved that @g"a^'(G)=<@D(G)+6 for a planar graph G without cycles of length three and that the same holds if G has an edge-partition into two forests.

TL;DR: Given a point set in a fixed dimension, it is noted that a well-separated pair decomposition can be found in linear time if the ratio of the farthest pair distance to the closest pair distance is polynomially bounded.

TL;DR: The concept of forward looking Nash equilibrium for the position auction (also called the generalized second price auction), a widely studied protocol for Internet advertisement bidding processes, is introduced and it is shown that it has a unique solution for the positions auction.

TL;DR: A generalization of Welzl's smallest enclosing disk algorithm for point sets lying in information-geometric spaces is presented and how to solve a statistical model estimation problem by computing the center of a finite set of univariate normal distributions is shown.

TL;DR: Some vertex vulnerability parameters of the Kronecker product of complete graphs K"mxK"n for n >=m>=2 and n>=3 are determined.

TL;DR: This work presents a linear-time algorithm for computing a triangulation of n points in 2D whose positions are constrained to n disjoint disks of uniform size, after O(nlogn) preprocessing applied to these disks.

TL;DR: It is shown that no deterministic online algorithm can achieve a competitive ratio smaller than 2k+1 and an easy algorithm is given which matches this lower bound.

TL;DR: It is shown how Ohori and Sasano's recent lightweight fusion by fixed-point promotion provides a simple way to prove the equivalence of the two standard styles of specification of abstract machines: in small-step form, as a state-transition function together with a 'driver loop', and in big- step form as a tail-recursive function that directly maps a given configuration to a final state, if any.

TL;DR: This article shows that the problem of operability of open nets, i.e., Petri net models of business processes and workflows, is in general undecidable.

TL;DR: The complexity of a decentralised colouring algorithm that has recently been proposed for channel selection in wireless computer networks is analyzed.

TL;DR: Caha and Koubek showed that for 6m==3, there is a balanced set P in Q"n such that 2m-e=n, but no path partition with endvertices prescribed by P exists.

TL;DR: A 7/3-competitive algorithm for the PCTSP is given, which compares with a lower bound of 2 on the competitive ratio of any deterministic algorithm and can be combined with an approximation algorithm to obtain an O(1)-competitive algorithm that runs in polynomial time.

TL;DR: In this article, the authors present a new approach to TMTO attacks against stream ciphers using a publicly known initial value (IV): they suggest not to treat the IV as part of the secret key material (as done in current attacks), but rather to choose in advance some IVs and apply a TMTO attack to streams produced using these IVs.

TL;DR: The Matching Composition Network (MCN) is a family of networks which two components are connected by a perfect matching and the globally two-equal-disjoint path cover property of MCN is considered.

TL;DR: Under the restricted condition that each vertex has at least two fault-free adjacent vertices, all hypercube-like networks still have the strong Menger property, even if there are up to 2n-5 vertex faults.