Dykstra’s algorithm is a suitable alternating projection scheme for solving the optimization problem of finding the closest point to a given one in the intersection of a finite number of closed and convex sets. It has been recently used in a wide variety of applications. However, in practice, the commonly used stopping criteria are not robust and could stop the iterative process prematurely at ...

We propose a solution on the stopping criterion in segmenting inhomogeneous DNA sequences with complex statistical patterns. This new stopping criterion is based on Bayesian information criterion in the model selection framework. When this criterion is applied to telomere of S. cerevisiae and the complete sequence of E. coli, borders of biologically meaningful units were identified, and a more ...

where Ωi are closed and convex sets in IR , for i = 1, 2, . . . , p, and Ω 6= ∅. Moreover, we assume that for any z ∈ IR the calculation of PΩ(z) is not trivial; whereas, for each Ωi, PΩi(z) is easy to obtain as in the case of a box, an affine subspace, or Department of Computer Science IME-USP, University of São Paulo, Rua do Matão 1010, Cidade Universitária, 05508-090, São Paulo SP, Brazil. T...

This paper presents two simple and effective criteria for stopping the iteration process in turbo decoding with a negligible degradation of the error performance. Both criteria are devised based on the cross-entropy (CE) concept. They are as efficient as the CE criterion, but require much less and simpler computations.

The Golub–Kahan bidiagonalization algorithm has been widely used in solving leastsquares problems and in the computation of the SVD of rectangular matrices. Here we propose an algorithm based on the Golub–Kahan process for the solution of augmented systems that minimizes the norm of the error and, in particular, we propose a novel estimator of the error similar to the one proposed by Hestenes a...

Selecting the optimal number of features in a classifier ensemble normally requires a validation set or cross-validation techniques. In this paper, feature ranking is combined with Recursive Feature Elimination (RFE), which is an effective technique for eliminating irrelevant features when the feature dimension is large. Stopping criteria are based on out-of-bootstrap (OOB) estimate and class s...

improving the quality of medical images at pre and post-surgery operations are necessary for beginning and speeding up the recovery process. partial differential equations (pdes)-based models have become a powerful and well known tool in different areas of image processing such as denoising, multiscale image analysis, edge detection and other fields of image processing and computer vision. in t...

Active learning is a proven method for reducing the cost of creating the training sets that are necessary for statistical NLP. However, there has been little work on stopping criteria for active learning. An operational stopping criterion is necessary to be able to use active learning in NLP applications. We investigate three different stopping criteria for active learning of named entity recog...

When testing software, testers rarely use only one technique to generate tests that, they hope, will fulfill their testing criteria. Malaiya showed that testers switch strategies when testing yield saturates. We present and evaluate a stopping rule that can be used to determine when it is time to switch to a different testing technique, because the current one is not likely to increase criteria...