Related papers: Errors in Low and Lapsley's article "Optimization …

We present an exploration of the rich theoretical connections between several classes of regularized models, network flows, and recent results in submodular function theory. This work unifies key aspects of these problems under a common…

In this article, we present our improved algorithm for error localization from counterexamples, LocFaults, flow-driven and constraint-based. This algorithm analyzes the paths of CFG (Control Flow Graph) of the erroneous program to calculate…

In this article we give corrections and addendum to the article ``Flops and Poisson deformations of symplectic varieties, Publ. Res. Inst. Math. Sci. {\bf 44} (2008) 259 - 314''.

In this work and the supporting Parts II [2] and III [3], we provide a rather detailed analysis of the stability and performance of asynchronous strategies for solving distributed optimization and adaptation problems over networks. We…

The aim of this paper is a short survey of models and methods that developed by the authors. These models and methods are used to optimize general networks with nonlinear non-convex restrictions and objectives possessing mixed…

This paper has been withdrawn by the author due to some errors.

This is a correction to the afore-mentioned paper in Duke Math. J. vol. 75 (1994), 99-119 by S. Keel, K. Matsuki, and J. McKernan. We completely rewrite Chapter 6 according to the original manuscript of the second author, in order to fix…

This manuscripts corrects some minor error in the paper, Mod. Phys. Lett. A 6 1893 (1991)

The original version of the paper was published in Contemporary Mathematics 378 ``Groups, Languages, Algorithms''; 2005, pp. 319-348. This is a modified version with Appendix that holds a corrected formulation of Proposition 4.1.

Recent work has shown that machine-learned predictions can provably improve the performance of classic algorithms. In this work, we propose the first minimum-cost network flow algorithm augmented with a dual prediction. Our method is based…

Developing of an effective flow control algorithm to avoid congestion is a hot topic in computer network society. This document gives a mathematical model for general network at the beginning, and then discrete control theory is proposed as…

In this correspondence, it is given a correction to Theorem 4 in Y. Hu, and G. Xiao, "Generalized Self-Shrinking Generator," IEEE Transactions on Information Theory, vol. 50, No. 4, pp. 714-719, April 2004.

This note corrects some serious errors in the first-order perturbation analysis of singular vectors as published by G.W. Stewart in his book "Matrix Algorithms Volume II: Eigensystems", SIAM, 2001.

The paper (as posted originally) contains several errors. It has been subsequently split into two papers, the corrected (and accepted for publication) versions appear in the archive as papers cs.CC/0503082 and cs.DM/0503083.

This is a list of corrections for the book: J. Noguchi and T. Ochiai, Geometric Function Theory in Several Complex Variables, xi + 282 pp., Math.\ Monographs Vol.\ {\bf 80}, Amer.\ Math.\ Soc., Providence, 1990. The authors hope that this…

We study the error rate of LLMs on tasks like arithmetic that require a deterministic output, and repetitive processing of tokens drawn from a small set of alternatives. We argue that incorrect predictions arise when small errors in the…

Deep learning approaches have achieved great success in addressing the problem of optical flow estimation. The keys to success lie in the use of cost volume and coarse-to-fine flow inference. However, the matching problem becomes ill-posed…

In this work, some counterexamples are given to refute some results reported in the paper by Guo and Li [8] (J Optim Theory Appl 162,(2014), 821-844). We correct the faulty in some of their theorems and we present alternative proofs.…

Theorem~ 4.1 in the 2011 paper "A Framework for Control System Design Subject to Average Data-Rate Constraints" allows one to lower bound average operational data rates in feedback loops (including the situation in which encoder and decoder…

We present two methods for proving confluence of left-linear term rewrite systems. One is hot-decreasingness, combining the parallel/development closedness theorems with rule labelling based on a terminating subsystem. The other is…