Showing papers in "Information Processing Letters in 2011"

TL;DR: An improved artificial bee colony (IABC) algorithm for global optimization is presented, Inspired by differential evolution and introducing a parameter M, that uses a selective probability p to control the frequency of introducing “ABC/rand/1” and “ ABC/best/1" and gets a new search mechanism.

TL;DR: By adding different activation functions, a type of gradient-based neural networks is developed and presented for the online solution of Lyapunov matrix equation and has superior convergence when compared to linear models.

TL;DR: A data model for userrank calculations, a PageRank-based user ranking approach, and a userrank-based item similarities/differentials computing approach are proposed to improve the quality of recommendations in item-based Collaborative Filtering.

TL;DR: It is shown that every 1-planar graph with maximum degree Δ?10 can be edge-colored with Δ colors, and it is proved thatevery 1- Planar graphs withmaximum degree at least 10 is of class 1 in terms of the edge coloring.

TL;DR: This short paper provides very simple and efficient algorithms for solving the spread maximization problem in the context of the well studied probabilistic voter model and concludes that the most natural heuristic solution, which picks the nodes in the network with the highest degree, is indeed the optimal solution.

TL;DR: A very simple construction is presented that, given a context-free grammar, produces a finite automaton recognizing such a regular language.

TL;DR: Given a matrix A@?R^n^x^n, this work presents a simple, element-wise sparsification algorithm that zeroes out all sufficiently small elements of A and then retains some of the remaining elements with probabilities proportional to the square of their magnitudes.

TL;DR: This paper restricts its attention to the VCP"3 problem and gives a 2-approximation algorithm using the technique of layering.

TL;DR: An entropy-based process measure is proposed to quantify the uncertainty of business process models and enables capturing the dynamic behavior of processes, in contrast to previous work which focused on providing measures for the static aspect of process models.

TL;DR: It is determined that the super connectivity and the super edge-connectivity of EH(s,t) are 2s where s= s= and t=1.

TL;DR: The stochastic matching problem with applications in online dating and kidney exchange was introduced by Chen et al. together with a simple greedy strategy and it was conjectured that the greedy algorithm is in fact a 2-approximation, which is confirmed in this paper.

TL;DR: The improvement for Cluster Editing is achieved by using the full power of an earlier structure theorem for graphs where no edge is in three conflict triples.

TL;DR: This paper shows how the proposed kernelization algorithm for vertex cover can be extended to improve the produced kernel to order 2k-clogk, for any fixed constant c.

TL;DR: An FPTAS for the partition function is presented and uniqueness of Gibbs measure of the two-state spin system on a bounded degree infinite graph is proved, under the same condition that the absolute value of inverse temperature is small.

TL;DR: This paper is the first to lay the bases for the design of self-stabilizing message passing algorithms over unreliable non-FIFO channels, and proposes an optimal stabilizing data-link layer that emulates a reliable FIFO communication channel over unreliable capacity boundedNon-FifO channels.

TL;DR: This paper finds that there exists a kind of BC graphs called spined cubes and it is proved that the n-dimensional spined cube has the diameter @?n/[email protected]?+3 for any integer n with n>=14.

TL;DR: The question affirmatively whether there is a subexponential algorithm for Partial Vertex Cover and Partial Dominating Set is answered by solving both problems in time 2^O(^k^)n^O^(^1^) not only on planar graphs but also on much larger classes of graphs, namely, apex-minor-free graphs.

TL;DR: This work completely characterize sizes of teams of robots capable of exploring an n-node line and gives an exploration algorithm for all values of k for which exploration is possible and proves an impossibility result.

TL;DR: A complete proof of the following theorem is given: Every de Bruijn sequence of order n in at least three symbols can be extended to a de Bru Netherlands sequence ofOrder n+1.

TL;DR: This work shows how to compute the Longest Previous non-overlapping Factor table in linear time from the suffix array of the string when it is drawn from an integer alphabet.

TL;DR: It is shown that the exact computation of a minimum or a maximum cut of a given graph G is out of reach for any one-pass streaming algorithm, that is, for any algorithm that runs over the input stream of G's edges only once and has a working memory of o(n2) bits.

TL;DR: This paper investigates the R^h-connectivity of the (n,k)-arrangement graph A"n","k for h=1 and h=2, and determines that @k^1(A"n),"k)=(2k-1)(n-k)-1 and@k^2(A’s)k)=(3k-2)(n -k)-2, respectively.

TL;DR: It is obtained that the exact wirelength of 1-fault hamiltonian graphs into wheels and fans is the same as that of circulant graphs, generalized Petersen graphs, augmented cubes, crossed cubes, Mobius cubes, locally twisted cubes, twisted cube networks, generalized twisted n-cubes, hierarchical cubic networks and tori.

TL;DR: A simple unified algorithmic process which uses either LexBFS or MCS on a chordal graph to generate the minimal separators and the maximal cliques in linear time in a single pass is presented.

TL;DR: It is proved that there exists no algorithm to decide whether the language generated by a context-free grammar is dense with respect to the lexicographic ordering, and it is shown that it is undecidable whether the order is dense.

TL;DR: Borders for Generalized Black-peg Mastermind are given for arbitrary numbers p, c and an upper bound recently proved by Goodrich is improved, which is to give bounds for the general case b(p,c).

TL;DR: An on-line algorithm is presented which constructs a parameterized suffix tree in randomized O(n) time, where n is the length of the input string and the algorithm is the first randomized linear time algorithm for the on- line construction problem.

TL;DR: This paper addresses the total completion time minimization in a two-stage differentiation flowshop where the sequences of jobs per type are predetermined and proposes an O(m^2@?"k"="1^mn"k^m^+^1) dynamic programming algorithm, where n is the number of type-k jobs.

TL;DR: It is shown that squares of strongly chordal split graphs can be recognized in quadratic-time by giving a structural characterization of these graph class.

TL;DR: The minimal core of the StaDyn programming language is described, which performs type reconstruction over both dynamic and static implicitly typed references, and improves runtime performance and robustness.