Showing papers in "Information Processing Letters in 2006"

TL;DR: A new algorithm for drawing a weighted random sample of size m from a population of n weighted items, where m ≤ n, is presented and can generate a weightedrandom sample in one-pass over unknown populations.

TL;DR: Not only does this technique comprise a general interesting framework for the GAP problem; it also matches the best combinatorial approximation for this problem, with a much simpler algorithm and a better running time.

TL;DR: A polynomial time approximation algorithm with a performance ratio of 2 for this class of problems with interval data with minmax regret is proposed.

TL;DR: This paper presents efficient approximation algorithms for finding the smallest set G of points of P so that each point of P is seen by at least one point of G, and the points of G are constrained to be belong to the set of vertices of an arbitrarily dense grind.

TL;DR: It is proved that for any e > 0 there exists an integer ne such that the pathwidth of every cubic (or 3-regular) graph on n > ne vertices is at most (1/6 + e)n.

TL;DR: The optimization problem of measuring all nodes in an electrical network by placing as few measurement units (PMUs) as possible can be solved in linear time for graphs of bounded treewidth and bounds are established on its parameterized complexity if the number of PMUs is the parameter.

TL;DR: A cellular Genetic Algorithm (cGA)--a kind of decentralized population based heuristic--is used for solving CVRP, improving several of the best existing results so far in the literature.

TL;DR: A quantum lower bound of Ω(d) qubits in the general interactive model with shared prior entanglement is proved and a classical protocol of O(d log d) bits in the restricted Simultaneous Message Passing model with public random coins is constructed.

TL;DR: In this paper, Chandra and Toueg proposed a failure detector called Weak Completeness, which guarantees that every process that fails is permanently suspected by some correct process, and showed that weak completeness can be used to solve consensus in crash-prone asynchronous systems with reliable links.

TL;DR: It is shown that the time complexity of the latest algorithm has been reduced from O(n2 ċ A) to O( n A), without increase in space complexity, for n code fragments and hardware area A.

TL;DR: It is shown that a connected graph is a 3-leaf power if and only if it results from substituting cliques into the vertices of a tree and also leads to linear time recognition of these graphs.

TL;DR: It is shown that Cayley graphs may be good models for deterministic small-world networks and can be used for designing and analyzing communication and the other real networks.

TL;DR: The results suggest lth-order empirical entropy stops being a reasonable complexity metric for almost all strings of length m over alphabets of size n about when nl surpasses m.

TL;DR: An O(n log n) time construction algorithm that is easy to implement and combinatorial and topological properties of the farthest line segment Voronoi diagram are outlined.

TL;DR: This paper considers a weighted version of the coloring problem which consists in finding a partition S of the vertex set of G into stable sets and minimizing Σi=1k w(Si) where the weight of S is defined as max{w(v): v ∈ S}.

TL;DR: Simple and practical algorithms for finding all pattern occurrences in sublinear time on average for parameterized string matching the pattern P matches a substring t of the text T if there exist a bijective mapping from the symbols of P to the symbol of t.

TL;DR: This paper provides simple undecidability proofs using a "constructive" version of the problems where the authors require not just a yes/no answer, but also a "witness" and proofs are then simple reductions from the universality problem.

TL;DR: A constructive proof that the register allocation problem for a uniform register set is solvable in polynomial time for SSA-form programs is given.

TL;DR: This paper shows that for any two different vertices u and v in [email protected]?{MQ"n,CQ"n} with n>=3, there exists a uv-path of every length from d"G(u,v)+2 to 2^n-1 except for a shortest uv -path.

TL;DR: This work by-passes this addition step and construct a polynomial size logarithmic depth unbounded fan-in monotone circuit for every weighted threshold function, i.e., it is shown that weighted threshold functions are in mAC^1.

TL;DR: It is proved that, if the distance function is metric, then the approximation ratio of RGREEDY is between Ω( log n/log log n) and O(log n).

TL;DR: This paper considers multiple QoS based grid resource scheduling, where each of grid task agent's diverse requirements is modeled as a quality of service dimension.

TL;DR: It is shown that if M is a DFA with n states over an alphabet with at least two letters and L = L(M), then the worst-case state complexity of L2 is n2n - 2n-1.

TL;DR: In this article, it was shown that for any feasible general access structure, a strong ramp secret sharing (SS) scheme can be constructed from a partially decryptable ramp SS scheme, which can be considered as a kind of SS scheme with plural secrets.

TL;DR: This work presents the first derivation of the search phase of the Boyer-Moore string-matching algorithm by partial evaluation of an inefficient string matcher, and identifies the bad-character-shift heuristic as a binding-time improvement, bounded static variation.

TL;DR: This work presents an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - e), which improves the previously best approximation ratios of an NC algorithm.

TL;DR: A new, efficient implementation of nodes in the Aho Corasick automaton is introduced, which works for suffix trees as well and costs O(n) time and space for integer alphabets.

TL;DR: A Coq-formalized proof that all non-cooperative, sequential games have a Nash equilibrium point is presented, believed to be a first as far as formalized game theory goes.

TL;DR: The first Domingo-Ferrer's algebraic privacy homomorphism can be broken in O(d4 log dn + d3 log 2 n + e(m) time with overwhelming probability as mentioned in this paper.