For stationary or quasi-stationary frames of a video sequence, traditional block matching algorithms (BMA) will easily lead the search to be trapped into a local minimum. In this paper, a novel method called the threshold-aware two-path search (TATPS) block matching algorithm is presented. Different from other BMAs, our proposed TATPS algorithm uses two search paths. With the threshold predeter...

in this paper, we show how to obtain suitable differential charactristics for block ciphers with neural networks. we represent the operations of a block cipher, regarding their differential characteristics, through a directed weighted graph. in this way, the problem of finding the best differential characteristic for a block cipher reduces to the problem of finding the minimum-weight multi-path...

Although multipath tree-structured vector quantization (MP-TSVQ) has a higher probability of determining the closest codeword for each input vector than singlepath TSVQ(SP-TSVQ), it lacks flexibility in some cases because of the fixed number of search paths. To overcome this drawback, we propose the side-match prediction TSVQ (SMP-TSVQ) to make the number of search paths adjustable. SMP-TSVQ us...

SEEP executes the code under test symbolically to extract all code paths and their path constraints. On basis of these results, SEEP crafts program code with predefined input data, so-called path entities. For each path entity, SEEP generates a runtime execution trace by executing them on a test system and increments a block counter for every basic block (branchless sequence of code) each time ...

An isometric path between two vertices in a graph G is a shortest path joining them. The isometric-path number of G, denoted by ip(G), is the minimum number of isometric paths required to cover all vertices of G. In this paper, we determine exact values of isometric-path numbers of block graphs. We also give a linear-time algorithm for finding the corresponding paths.