Results 11 to 20 of about 5,120,600 (306)
On the minimum stopping sets of product codes [PDF]
Transactions on Combinatorics, 2018 It is shown that the certain combinatorial structures called stopping sets have the important role in analysis of iterative decoding. In this paper, the number of minimum stopping sets of a product code is determined by the number of the minimum stopping
Morteza Hivadi, Akbar Zare Chavoshi
doaj +3 more sources
Target-Session early stopping for cross-session EEG mental workload classification: a reusable deployment-oriented method [PDF]
MethodsXCross-session EEG mental workload classifiers degrade severely when applied to new recording sessions from the same individual. A key but overlooked cause is the model selection criterion: standard within-session validation rewards checkpoints that ...
Abinaya G
doaj +2 more sources
Stopping Sets of Algebraic Geometry Codes [PDF]
IEEE Transactions on Information Theory, 2014 Stopping sets and stopping set distribution of a linear code play an important role in the performance analysis of iterative decoding for this linear code. Let $C$ be an $[n,k]$ linear code over $\f$ with parity-check matrix $H$, where the rows of $H$ may be dependent. Let $[n]=\{1,2,...,n\}$ denote the set of column indices of $H$.
Zhang, Jun, Fu, Fang-Wei, Wan, Daqing
openaire +6 more sources
Don't Stop Me Now, `Cause I'm Having a Good Time Screening: Evaluation of Stopping Methods for Safe Use of Priority Screening in Systematic Reviews [PDF]
Cochrane Evidence Synthesis and MethodsIntroduction Priority screening has the potential to reduce the number of records that need to be annotated in systematic literature reviews. So‐called technology‐assisted reviews (TAR) use machine‐learning with prior include/exclude annotations to ...
Tim Repke +7 more
doaj +2 more sources
Stopping set analysis of repeat multiple-accumulate codes
2009 IEEE International Symposium on Information Theory, 2009 In this work, we consider a stopping set analysis of repeat multiple-accumulate (RMA) code ensembles formed by the serial concatenation of a repetition code with multiple accumulators. The RMA codes are assumed to be iteratively decoded in a constituent code oriented fashion using maximum a posteriori erasure correction in the constituent codes.
Eirik Rosnes, Alexandre Graell i Amat
openaire +3 more sources
Stopping Set Analysis for Concatenated Polar Code Architectures
CoRRThis paper investigates properties of concatenated polar codes and their potential applications. We start with reviewing previous work on stopping set analysis for conventional polar codes, which we extend in this paper to concatenated architectures.
Ziyuan Zhu, Paul H. Siegel
openaire +3 more sources
Multi-objective calibration of Tank model using multiple genetic algorithms and stopping criteria [PDF]
RBRH, 2022 Calibration of hydrologic models estimates parameter values that cannot be measured and enable the rainfall-runoff processes simulation. Multi-objective evolutionary algorithms can make the calibration faster and more efficient through an iterative ...
Juan Carlos Ticona Gutierrez +4 more
doaj +1 more source
Improvement of accident prevention measures in cases of spontaneous derailment of railway rolling stock [PDF]
E3S Web of Conferences, 2023 There has been researched on railway station tracks to determine the method of automatically stopping motion content in cases where Motion Content has gone away on its own.
Yusupov Aziz +3 more
doaj +1 more source
Impact of Stop Sets on Stopping Active Learning for Text Classification
2022 IEEE 16th International Conference on Semantic Computing (ICSC), 2022 Active learning is an increasingly important branch of machine learning and a powerful technique for natural language processing. The main advantage of active learning is its potential to reduce the amount of labeled data needed to learn high-performing models.
Luke Kurlandski, Michael Bloodgood
openaire +3 more sources
New stopping criteria for iterative root finding [PDF]
Royal Society Open Science, 2014 A set of simple stopping criteria is presented, which improve the efficiency of iterative root finding by terminating the iterations immediately when no further improvement of the roots is possible.
Jorgen L. Nikolajsen
doaj +1 more source