Showing papers in "Information Processing Letters in 2013"

TL;DR: A simple linear time algorithm for checking if a given sequence y of length n contains a factor which is order-isomorphic to a given pattern x, which is a subsequence of consecutive symbols of y is presented.

TL;DR: In this article, an even simpler linear-time algorithm is presented that computes a structure from which both the 2-vertex- and 2-edge-connectivity of a graph can be easily ''read [email protected]?"'.

TL;DR: In this paper, the authors show that RAPP is vulnerable to desynchronization attack. But they do not specify whether Hamming weight-based or modular-based rotations are used by the protocol.

TL;DR: This paper considers a kind of generalized measures of fault tolerance in EH(s,t) with 1@?s@?t and determines @k^(^h^)(EH( s,t))=@l^( ^h^(s+1-h) for any h with 0@?h @?s, and generalizes some known results.

TL;DR: The density of 1-planar straight-line drawings with additional constraints on the vertex positions is investigated and it is proved that this bound is tight for infinitely many values of n>=8.

TL;DR: This work investigates the complexity of model checking (finite) interval-valued discrete time Markov chains and shows that PCTL model checking problem under the IMDP semantics is P-complete, meaning that one can reduce the Square-Root-Sum problem to it.

TL;DR: Theoretical analysis shows that, by using any monotonically-increasing odd activation function, the gradient-based neural networks (GNN) can solve the Lyapunov equation exactly and efficiently.

TL;DR: A preimage attack on reduced versions of Keccak hash functions, using the recently developed toolkit CryptLogVer for generating the conjunctive normal form, CNF, which is passed to the SAT solver PrecoSAT.

TL;DR: A deterministic approximation algorithm with performance ratio of O(lnK) for the min-max version of the problem is proposed and it is shown that both min- Max and min- max regret problems are not approximable within any constant factor unless P=NP, which strengthens the results known up to date.

TL;DR: It is shown that every lobster is odd-elegant because the set of all edge labels is equal to {1,3,5,...,2q-1}.

TL;DR: This paper proves that the VCP"3 problem is NP-hard for cubic planar graphs of girth 3 and gives sharp lower and upper bounds on @j"3(G) for cubic graphs and proposes a 1.57-approximation algorithm for the VCEP3 problem in cubic graphs.

TL;DR: The main point of this note is to show that the asymmetric game in fact characterizes tree-like Resolution proof size, i.

TL;DR: The first result is an alternative construction of the index by Badkobeh et al. (2012) that obtains a trade-off between the space and the time complexity, and an O(n^2log^2w/w) algorithm based on word-level parallelism where w is the word size in bits.

TL;DR: An index constructed directly from the run-length encoding of s is proposed, characterized in terms of the prefix normal forms of s introduced in Fici and Liptak (2011) in an attempt to shed light on the structure and size of the index.

TL;DR: The purpose of this paper is to design a transformation process that can transfer all the discrete logarithm and integer factorization based cryptosystems into the ID-based systems rather than re-invent a new system.

TL;DR: It is shown that the problem of calculating the minimum number of hybridization events that is needed to explain a set of rooted binary phylogenetic trees by means of a hybridization network is fixed-parameter tractable if an instance of the problem consists of precisely two such trees.

TL;DR: A short proof that a standard model for the Physarum polycephalum slime mold correctly computes the shortest path in an undirected weighted graph is given.

TL;DR: In this paper, it was shown that the BPA bisimilarity problem is EXPTIME-hard given a basic process algebra (BPA) and two stack symbols, and that the problem is NP-hard.

TL;DR: A new randomized FPT algorithm is presented for the Bipartite Contraction problem, which is both conceptually simpler and achieves an improved 2^O^(^k^^^2^)nm running time, i.e., avoiding the double-exponential dependence on k.

TL;DR: It is shown that for the case of 2 competing agents, there exists a Nash Equilibrium for this game on any tree and that this is not necessarily true for 3 or more agents.

TL;DR: This is the first algorithm which can parallelly construct the ISTs in crossed cubes and can be parallelized to run in time O(logN).

TL;DR: The paper proves that there is a polynomial time algorithm for determining the proper orientation number of 3-regular graphs and proves that this problem is NP-hard for 4- regular graphs.

TL;DR: The Split Vertex Deletion problem can be solved in the same time as the well-studied Vertex Cover problem and all maximal induced split subgraphs of a given n-vertex graph can be listed in O(3^n/^3n^O^(^l^o^g^n^)) time.

TL;DR: This work disproves a conjecture by Skupien that every tree of order n has at most 2^n^/^2 minimal dominating sets and provides an algorithm for listing all minimal dominate sets of a tree in time O(1.4656^n).

TL;DR: An index for top-k most frequent document retrieval whose space is CSA, and its query time is O ( log k log 2 + ϵ n ) per reported document, improves over previous results for this problem.

TL;DR: In this article, the authors considered two parameterizations of the test cover problem with parameter k: (a) deciding whether there is a test cover with at most k tests, and (b) decide whether there are at most |V|-k tests.

TL;DR: A method for finding the shortest hyperpath in an intuitionistic fuzzy weighted hypergraph is proposed, which is done using the scores and accuracy of the model.

TL;DR: In this article, a linear time algorithm for finding all Abelian periods in a string is presented. But the algorithm is based on a reduction of the problem of all Abelians periods to that of (already solved) Abelian squares which provides new insight into both connected problems.

TL;DR: A rationalized algorithm for calculating the product of sedenions is presented which reduces the number of underlying multiplications and can compute the same result in only 122 multiplications (or multipliers - in hardware implementation case) and 298 additions.

TL;DR: The localdiagnosability and strong local diagnosability properties for ( n, k ) -star graphs and Cayley graphs generated by 2-trees are studied.