منابع مشابه
A Parallel Matrix Scaling Algorithm
We recently proposed an iterative procedure which asymptotically scales the rows and columns of a given matrix to one in a given norm. In this work, we briefly mention some of the properties of that algorithm and discuss its efficient parallelization. We report on a parallel performance study of our implementation on a few computing environments.
متن کاملDewey a Scaling Algorithm for Multicommodity Flow Problems a Scaling Algorithm for Multicommodity Flow Problems
We present a penalty-based algorithm that solves the multicommodity flow problem as a sequence of a fmite number of scaling phases. In the 8-scaling phase the algorithm determines an eoptimal solution, that is, one in which complementary slackness conditions are satisfied to within 8. We analyze the performance of the algorithm from both the theoretical and practical perspectives.
متن کاملA New Algorithm for Enhanced Robustness of Copyright Mark
This paper discusses a new heavy tailed distribution based data hiding into discrete cosine transform (DCT) coefficients of image, which provides statistical security as well as robustness against steganalysis attacks. Unlike other data hiding algorithms, the proposed technique does not introduce much effect in the stegoimage’s DCT coefficient probability plots, thus making the presence of hidd...
متن کاملA robust multi-phase pitch-mark detection algorithm
This paper describes a robust multi-phase algorithm for marking of pitch pulses in speech using both glottal and speech signals. In the first phase, the glottal signal is used for the estimation of the fundamental frequency (f0) contour of the given sentence. Next, pitch mark candidates are generated on the basis of both glottal and speech signals. In the third phase, the best sequence of pitch...
متن کاملA Symmetry Preserving Algorithm for Matrix Scaling
We present an iterative algorithm which asymptotically scales the ∞-norm of each row and each column of a matrix to one. This scaling algorithm preserves symmetry of the original matrix and shows fast linear convergence with an asymptotic rate of 1/2. We discuss extensions of the algorithm to the one-norm, and by inference to other norms. For the 1-norm case, we show again that convergence is l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1983
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/26.2.109