Showing papers in "Information Processing Letters in 2015"

TL;DR: These tools for solving MWIS efficiently on odd-hole- and co-chair-free graphs are combined by showing that atoms of prime odd-holes-and-co-Chair- free graphs are nearly perfect and atoms ofprime hole- and- co- chair-free graph are nearly weakly chordal.

TL;DR: It is shown that in general, the PageRank of an undirected graph is not exactly proportional to the degree distribution of the graph: the main theorem gives an upper and a lower bound to the L 1 norm of the difference of thePageRank and thedegree distribution vectors.

TL;DR: It is shown that hyperbolicity at a fixed base-point cannot be computed in O ( n 2.05 ) time, unless there exists a faster algorithm for (max,min) matrix multiplication than currently known.

TL;DR: A method of deciding the order-isomorphism between two strings even when there are same characters is presented and it is shown that the bad character rule of the Horspool algorithm for generic pattern matching problems can be applied to the OPPM problem and a space-efficient algorithm for computing shift tables for text search is presented.

TL;DR: A proportionate flow shop problem to maximize the weighted number of Just-in-Time jobs is solved with a pseudo-polynomial algorithm which is faster than the one known in the literature.

TL;DR: This work considers the following decision problem: given a finite Markov chain with distinguished source and target states, and given a rational number r, does there exist an integer n such that the probability to reach the target from the source in n steps is r?

TL;DR: This paper restricts its attention to the VCP 3 problem and presents a fixed-parameter algorithm with runtime O ( 2 k k 3.376 + n 4 m ) for the V CP 3 problem.

TL;DR: The secure domination number γ s ( G) equals the minimum cardinality of a secure dominating set of G, which answers the question posed by Mynhardt at the 22nd Clemson mini-Conference, 2007.

TL;DR: It is shown that, over a k-letter alphabet, the number of words modulo ~ n is in 2 ? ( n k - 1 log ? n ) .

TL;DR: The security of dPEKS against KG attacks is redefined with the attacker being the server and the IND-KGA-SERVER security model is proposed to describe security against the server.

TL;DR: This paper proposes a new construction of ID-based encryption scheme based on integer factorization problem and discrete logarithm problem that is semantically secure against chosen plaintext attack (CPA) in random oracle model and outperforms the other existing schemes in terms of security, computational cost and the length of public key.

TL;DR: A practical O ( n m ) time and O ( 1 ) space solution for the longest common substring with k-mismatches problem, and a theoretical solution for one mismatch which runs in quasilinear time.

TL;DR: A novel general-form Zhang function (NGFZF) is proposed, developed and investigated, based on the NGFZF, which can be readily generated by successively selecting the different values of its parameters and the notion of infinitely many ZFs is proposed for the first time.

TL;DR: In this article, the authors considered a quantum version of the Winternitz-Hellman related-key attack model and showed that for a quantum adversary such attacks are quite powerful: if the secret key is determined by a small number of plaintext-ciphertext pairs, the block cipher can be evaluated efficiently, and a superposition of related keys can be queried, then the key can be extracted efficiently.

TL;DR: In this article, the authors studied the decidability of almost sure disclosure in Markov decision processes with partial or complete observation hypotheses for the schedulers and showed that all questions are decidable with complete observation and ω-regular secrets.

TL;DR: In this article, the authors build upon a previously proposed formal framework to certify the correctness of impossibility results regarding distributed algorithms that are dedicated to autonomous mobile robots evolving in a continuous space.

TL;DR: The correctness of the Certified Propagation Algorithm (CPA) in solving broadcast with locally bounded Byzantine faults is explored and a tight necessary and sufficient condition on the network topology is identified.

TL;DR: A polylogarithmic approximation algorithm is proposed for the Arc Orienteering Problem in directed graphs and a constant factor approximation algorithm for the AOP in undirected graphs is presented.

TL;DR: A framework for solving the minimum weighted efficient domination (Min-WED) problem is developed based on a reduction to the maximum weight independent set problem in the square of the input graph.

TL;DR: A stochastic gradient algorithm and a particle swarm optimization algorithm are proposed to estimate all the unknown parameters of the Hammerstein system and the Weierstrass approximation theorem is introduced to simplify the nonlinearity.

TL;DR: Experimental results show that the proposed mechanism achieves a significant reduction of the computational complexity by comparing with the original HEVC, while still maintaining high video quality.

TL;DR: A linear-time algorithm for computing the metric dimension for chain graphs, which are bipartite graphs whose vertices can be ordered by neighborhood inclusion, and order-theoretic arguments may be useful for other problems, as well.

TL;DR: This paper proposes a dynamic threshold SS based on a bivariate polynomial in which shares generated by the dealer can be used to reconstruct the secret but having a larger threshold which is equivalent to the exact number of participated shareholders in the process.

TL;DR: It's illustrated that such model can satisfied the requirement of data fusion in time domain and proper and solid decision can be made by this approach.

TL;DR: A new formulation requiring only O (k ) instead of O ( k 2 ) additional variables is proposed, where k is the number of criteria, and is shown to outperform the previously proposed formulation in computational experiments.

TL;DR: A single machine scheduling problem in which the processing time of a job is a linear function of its starting time and a variable maintenance on the machine must be performed prior to a given deadline is investigated, it is proved that both problems are NP-hard.

TL;DR: It is proved that if velocities of the mobile sensors are different, it is impossible to give any constant factor approximation algorithm to solve the sweep coverage problem unless P = NP, and a 3-approximation algorithm is proposed to guarantee sweep coverage of vertices of a graph.

TL;DR: In this paper, the affine-evasive set construction was used to obtain efficient non-malleable codes against affine tampering over F p, where p is a prime.

TL;DR: The pessimistic diagnosability of an n-dimensional alternating group graph, denoted by AG n, is determined and is shown to have the strong diagnosable property.

TL;DR: The proposed polynomial-time approximation scheme (PTAS) for the maximum independent set problem for a unit disk graph produces a solution of size 1 ( 1 + 1 k ) | OPT | in O ( 2 2 σ k n k + n log ⁡ n ) time using O ( 1 σ + n ) space.