Estimating the number of triangles in a graph is a fundamental problem and has found applications in many fields. This problem has been widely studied in the context of graph stream processing.

Abstract: This paper introduces an efficient modification to one of the most successful complexity reduction techniques of the Viterbi decoding algorithm; the adaptive Viterbi algorithm. Although the ...

ABSTRACT: A new nano-based architectural design of multiple-stream convolutional homeomorphic error-control coding will be conducted, and a corresponding hierarchical implementation of important class ...

ABSTRACT: A new nano-based architectural design of multiple-stream convolutional homeomorphic error-control coding will be conducted, and a corresponding hierarchical implementation of important class ...

The amino acid sequence of the transmembrane protein and its corresponding positions on the cell membrane are transformed into a hidden Markov process. After evaluating the parameters, the Viterbi ...

Pull requests help you collaborate on code with other people. As pull requests are created, they’ll appear here in a searchable and filterable list. To get started, you should create a pull request.

Modern C++17 Hidden Markov Model library with smart pointer memory management, comprehensive training algorithms, and critical bug fixes. Features Viterbi training, multiple probability distributions, ...

Abstract: The most famous error-decoding algorithm for con-volutional codes is the Viterbi algorithm. In this paper, we present a new reduced complexity version of this algorithm which can be applied ...