Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
487,709
About Iterative Processes Convergency
"... The convergency of iterative processes can present unexpected behaviours. In this paper an analysis of iterative processes convergency is made, and illustrated by its application to Newton method. This leads to the definition of a dynamic relaxation scheme that enables to master iterative processes ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
The convergency of iterative processes can present unexpected behaviours. In this paper an analysis of iterative processes convergency is made, and illustrated by its application to Newton method. This leads to the definition of a dynamic relaxation scheme that enables to master iterative processes
ON THE MANN AND ISHIKAWA ITERATION PROCESSES
"... Abstract. It is shown that a result of Chidume, involving the strong con-vergence of the Mann iteration process for continuous strongly accretive operators, is actually a corollary to a result by Nevanlinna and Reich. It is then shown that the Nevanlinna and Reich result can be extended to the case ..."
Abstract
- Add to MetaCart
Abstract. It is shown that a result of Chidume, involving the strong con-vergence of the Mann iteration process for continuous strongly accretive operators, is actually a corollary to a result by Nevanlinna and Reich. It is then shown that the Nevanlinna and Reich result can be extended to the case
A fast iterative shrinkage-thresholding algorithm with application to . . .
, 2009
"... We consider the class of Iterative Shrinkage-Thresholding Algorithms (ISTA) for solving linear inverse problems arising in signal/image processing. This class of methods is attractive due to its simplicity, however, they are also known to converge quite slowly. In this paper we present a Fast Iterat ..."
Abstract
-
Cited by 1058 (9 self)
- Add to MetaCart
We consider the class of Iterative Shrinkage-Thresholding Algorithms (ISTA) for solving linear inverse problems arising in signal/image processing. This class of methods is attractive due to its simplicity, however, they are also known to converge quite slowly. In this paper we present a Fast
An iterative method for the solution of the eigenvalue problem of linear differential and integral
, 1950
"... The present investigation designs a systematic method for finding the latent roots and the principal axes of a matrix, without reducing the order of the matrix. It is characterized by a wide field of applicability and great accuracy, since the accumulation of rounding errors is avoided, through the ..."
Abstract
-
Cited by 537 (0 self)
- Add to MetaCart
the process of "minimized iterations". Moreover, the method leads to a well convergent successive approximation procedure by which the solution of integral equations of the Fredholm type and the solution of the eigenvalue problem of linear differential and integral operators may be accomplished. I.
Iterative (turbo) soft interference cancellation and decoding for coded CDMA
- IEEE Trans. Commun
, 1999
"... Abstract — The presence of both multiple-access interference (MAI) and intersymbol interference (ISI) constitutes a major impediment to reliable communications in multipath code-division multiple-access (CDMA) channels. In this paper, an iterative receiver structure is proposed for decoding multiuse ..."
Abstract
-
Cited by 456 (18 self)
- Add to MetaCart
multiuser information data in a convolutionally coded asynchronous multipath DS-CDMA system. The receiver performs two successive softoutput decisions, achieved by a soft-input soft-output (SISO) multiuser detector and a bank of single-user SISO channel decoders, through an iterative process. At each
Turbo Codes and Iterative Processing
- in IEEE New Zealand Wireless Communications Symposium
, 1998
"... In 1993, a group of researchers from France presented a new class of error correction codes and an associated iterative decoding technique. These codes, termed "turbo codes", were shown to achieve performance within O. 7 decibels of the Shannon capacity limit. This constituted a significan ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
In 1993, a group of researchers from France presented a new class of error correction codes and an associated iterative decoding technique. These codes, termed "turbo codes", were shown to achieve performance within O. 7 decibels of the Shannon capacity limit. This constituted a
Computational Complexity of Iterative Processes
- SIAM Journal Computing
, 1972
"... Abstract. The theory of optimal algorithmic processes is part of computational complexity. This paper deals with analytic computational complexity. The relation between the goodness of an itera-tion algorithm and its new function evaluation and memory requirements are analyzed. A new con-jecture is ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
Abstract. The theory of optimal algorithmic processes is part of computational complexity. This paper deals with analytic computational complexity. The relation between the goodness of an itera-tion algorithm and its new function evaluation and memory requirements are analyzed. A new con
Spelling Correction as an Iterative Process
"... Logs of user queries to an internet search engine provide a large amount of implicit and explicit information about language. In this paper, we investigate their use in spelling correction of search queries, a task which poses many additional challenges beyond the traditional spelling correctio ..."
Abstract
- Add to MetaCart
correction problem. We present an approach that uses an iterative transformation of the input query strings into other strings that correspond to more and more likely queries according to statistics extracted from internet search query logs.
Pregel: A system for large-scale graph processing
- IN SIGMOD
, 2010
"... Many practical computing problems concern large graphs. Standard examples include the Web graph and various social networks. The scale of these graphs—in some cases billions of vertices, trillions of edges—poses challenges to their efficient processing. In this paper we present a computational model ..."
Abstract
-
Cited by 496 (0 self)
- Add to MetaCart
Many practical computing problems concern large graphs. Standard examples include the Web graph and various social networks. The scale of these graphs—in some cases billions of vertices, trillions of edges—poses challenges to their efficient processing. In this paper we present a computational
An implicit iterative process for nonexpansive mappings
"... Abstract. The purpose of this paper is to study weak and strong convergence of a new implicit iteration process to a common fixed point for a finite family of nonexpansive mappings in a uniformly convex Banach space. The results obtained in this paper extend and improve the corresponding results of ..."
Abstract
- Add to MetaCart
Abstract. The purpose of this paper is to study weak and strong convergence of a new implicit iteration process to a common fixed point for a finite family of nonexpansive mappings in a uniformly convex Banach space. The results obtained in this paper extend and improve the corresponding results
Results 1 - 10
of
487,709
