Showing papers in "Information Processing Letters in 2014"

TL;DR: In this article, a new deterministic algorithm for the feedback vertex set problem with parameterized by the solution size was presented, which runs in O((2+@f)^k) time, where @f < 1.619 is the golden ratio.

TL;DR: A new variable length GA algorithm to generate basis test paths which can be used as testing paths in any path testing method and defines all elements of GA to be compatible with path generation process.

TL;DR: This paper proposes the first MTSS based on the Asmuth–Bloom's SS which is unconditionally secure and one unique feature is that each shareholder needs to keep only one private share.

TL;DR: This work proves that the running time of randomized local search on OneMax is sharply concentrated around n ln n - 0.1159, and supplements the fitness-level method from the analysis of randomized search heuristics with tail bounds, including lower tails.

TL;DR: In this paper, it was shown that the h-extra connectivity of the 3-ary n-cubes for h = 3 is equal to 8 n − 12, where n ≥ 3.

TL;DR: This paper identifies zero-correlation linear approximations over 16 rounds of HIGHT and attacks 27-round HIGHT with improved time complexity and practical memory requirements, which significantly improves upon state-of-the-art in time and memory complexity.

TL;DR: A novel multiobjective clustering approach, named a quantum-inspired multiobjectives evolutionary clustering algorithm (QMEC), is proposed to deal with the problem of image segmentation, where two objectives are simultaneously optimized.

TL;DR: It is shown that the algorithm presented by Lenzen et al. is two times more effective than was previously assumed, and the gap between the lower bound and the approximation ratio of the best yet local deterministic distributed algorithm is reduced by half.

TL;DR: In this paper, the authors improved the lower bound of the doublyexponential gap between them to a single-exponential one, and showed that there exist no graphs with k terminals that have no mimicking network with at most k'th Hosten-Morris number of vertices.

TL;DR: It is proved that the proposed improved CL-S scheme is existentially unforgeable against adaptive chosen message attacks under the computational Diffie–Hellman assumption in the standard model.

TL;DR: It is shown that for both problems, @?log"2@?(n!)@? bits of advice are necessary and sufficient for a deterministic online algorithm to be optimal, where n denotes the number of vertices in one bipartition in the former problem, and thenumber of men in the latter.

TL;DR: Advanced technology of parallel computing has been applied both in software and hardware to search for maximum period NLFSRs having a fairly simple algebraic normal form.

TL;DR: This paper proves that partition dimension of a class of circulant graph G(n,+/-{1,2}), for all even n>=6 is three.

TL;DR: The paper studies the primitivity of the basic operators UNION, AND, OPTIONAL, FILTER, and SELECT, as they are used in the SPARQL query language, finding only AND is non-primitive.

TL;DR: Algorithms for the Maximum-Weight Box problem are described in two dimensions that run in the worst case inO(n 2 ) time, and much less on more specic classes of instances.

TL;DR: This article establishes that this is the case for very simple languages, namely for safety and reachability specifications in the intersection of LTL and ACTL, that distributed synthesis in the classical setting is undecidable for very weak languages.

TL;DR: Lower and upper bounds on the domination number of exchanged hypercubes are proved which imply that γ ( EH ( 2, t ) ) = 2 t + 1 holds for any t ?

TL;DR: In this paper, it was shown that edge contractions do not preserve the property that a set of graphs has bounded clique-width, while vertex-minors preserve bounded cliques.

TL;DR: This paper presents a 4n-move self-stabilizing algorithm for the minimal dominating set (MDS) problem under an unfair distributed daemon that stabilizes in at most 9n moves, where n is the number of nodes in the system.

TL;DR: An algorithm that estimates the number of connected components of a graph over n vertices within an additive error of @en in (sublinear) time O([email protected]^2log([ email protected])).

TL;DR: The multiterminal cut problem, which, given an n-vertex graph whose edges are integer-weighted and a set of terminals, asks for a partition of the vertex set such that each terminal is in a distinct part, is studied.

TL;DR: In this paper, the rebound attack technique was used to achieve collision attacks on the reduced round compression function of GOST R. The result on up to 9.5 rounds is proposed, the time complexity is 2.1^7^6 and the memory requirement is 2^1^2^8 bytes.

TL;DR: An output-sensitive algorithm for the enumeration of all maximal bicliques in a bipartite graph, tailored to the case when the degree distribution in one partite set is very skewed, achieves a worst-case bound better than previously known general bounds if, e.g., the degree sequence follows a power law.

TL;DR: This paper considers the restricted case of deriving arbitrary CI statements from so-called saturated ones, i.e., which involve all elements of S, and finds a necessary and sufficient condition under which the semigraphoid axioms are also complete for such derivations.

TL;DR: A new characterization of equimatchable graphs that are graphs with all maximal matchings having the same size is given and an O ( n 2 m ) -algorithm for deciding whether a general graph of order n and with m edges is equimATCHable is developed.

TL;DR: This work presents the second output-sensitive skyline computation algorithm which is faster than the only existing output- sensitive skyline computation algorithms in worst case because the algorithm does not rely on the existence of a linear time procedure for finding medians.

TL;DR: In this article, the authors consider an algebra where each clone splits into an interval of strong partial clones such that a strong partial clone corresponds to the CSPs that are solvable within the same O( c n ) bound.

TL;DR: The densmost k-set problem and a class of problems related to the concept of densest k-sets can be solved in time O ⁎ ( 1.7315 n ) .

TL;DR: This paper revisits the problem of constructing n ISTs rooted at an arbitrary node in CQ"n and shows that the proposed algorithm can be parallelized to run in O([email protected]?N) time using N=2^n nodes of CZ"n as processors.

TL;DR: It is proved that every Halin graph has oriented chromatic number at most 8, improving a previous bound by Hosseini Dolama and Sopena and confirming the conjecture given by Vignal, and solving an open problem presented by Sopena.