Journal: Information Processing Letters

Found 137 papers in total
Efficient feature selection based on correlation measure between continuous and discrete features
Efficient feature selection based on correlation measure between continuous and discrete features
2016,
Feature selection is frequently used to reduce the number of features in many...
A linear time algorithm for optimal k-hop dominating set of a tree
A linear time algorithm for optimal k-hop dominating set of a tree
2016,
We give a linear time algorithm to compute an optimal (minimum) k ‐hop...
An improvement of a cryptanalysis algorithm
An improvement of a cryptanalysis algorithm
2016,
In this paper we present simulations that show how some pseudo random number...
Signed digit data hiding scheme
Signed digit data hiding scheme
2016,
The EMD (Exploiting Modification Direction) method by Zhang and Wang uses ( 2 n +...
Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs
Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs
2016,
In this paper, we characterize the redundant rigidity and the redundant global...
A simple proof of optimality for the MIN cache replacement policy
A simple proof of optimality for the MIN cache replacement policy
2016,
The MIN cache replacement algorithm is an optimal off-line policy to decide which item...
Sufficient conditions for triangle-free graphs to be super k-restricted edge-connected
Sufficient conditions for triangle-free graphs to be super k-restricted edge-connected
2016,
An edge cut S of a connected graph G = ( V , E ) is a k ‐restricted edge cut if...
Mahonian STAT on words
Mahonian STAT on words
2016,
In 2000, Babson and Steingrimsson introduced the notion of what is now known as a...
NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting
NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting
2016,
Given an undirected graph and an integer q, the Edge Cover problem asks for a subgraph...
A Denial of Service attack against fair computations using Bitcoin deposits
A Denial of Service attack against fair computations using Bitcoin deposits
2016,
Bitcoin supports complex transactions where the recipient of a transaction can be...
Improved improbable differential attacks on ISO standard CLEFIA: Expansion technique revisited
Improved improbable differential attacks on ISO standard CLEFIA: Expansion technique revisited
2016,
Improbable differential cryptanalysis is a recent attack technique that generalizes...
Generalized MitM attacks on full TWINE
Generalized MitM attacks on full TWINE
2016,
TWINE is a lightweight block cipher which employs a generalized Feistel structure with...
Breaking an ID-based encryption based on discrete logarithm and factorization problems
Breaking an ID-based encryption based on discrete logarithm and factorization problems
2016,
Identity‐based (ID‐based) cryptography is very useful as it can simplify...
Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
2016,
A paired k -disjoint path cover (paired k -DPC for short) of a graph is a set of k...
On the efficiency of localized work stealing
On the efficiency of localized work stealing
2016,
This paper investigates a variant of the work‐stealing algorithm that we call...
A novel edge based image steganography with 2 k correction and Huffman encoding
A novel edge based image steganography with 2 k correction and Huffman encoding
2016,
Image steganography is the art of hiding information into a cover image. It derives...
Extension of the edge tracing algorithm to disconnected Voronoi skeletons
Extension of the edge tracing algorithm to disconnected Voronoi skeletons
2016,
One of the ways how to describe spatial relations among balls in Euclidean space is to...
On the semantics of Strategy Logic
On the semantics of Strategy Logic
2016,
We define and study a slight variation on the semantics of Strategy Logic: while in...
A filtration method for order-preserving matching
A filtration method for order-preserving matching
2016,
The problem of order-preserving matching has gained attention lately. The text and the...
Linear cryptanalysis of reduced-round SPECK
Linear cryptanalysis of reduced-round SPECK
2016,
SPECK is a family of lightweight block ciphers which was proposed by United States...
Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis
Tight lower bounds for the Workflow Satisfiability Problem based on the Strong Exponential Time Hypothesis
2016,
The Workflow Satisfiability Problem (WSP) asks whether there exists an assignment of...
L-visibility drawings of IC-planar graphs
L-visibility drawings of IC-planar graphs
2016,
An IC-plane graph is a topological graph where every edge is crossed at most once and...
Online scheduling of unit jobs on three machines with rejection: A tight result
Online scheduling of unit jobs on three machines with rejection: A tight result
2016,
We design an algorithm of the best possible competitive ratio for preemptive and...
Exploring acquaintances of social network site users for effective social event recommendations
Exploring acquaintances of social network site users for effective social event recommendations
2016,
In this paper, we propose a social event recommendation method that exploits a user's...
Papers per page: