Sciweavers

1997 search results - page 119 / 400
» On the convergence of Hill's method
Sort
View
ICML
2007
IEEE
16 years 2 months ago
Large-scale RLSC learning without agony
The advances in kernel-based learning necessitate the study on solving a large-scale non-sparse positive definite linear system. To provide a deterministic approach, recent resear...
Wenye Li, Kin-Hong Lee, Kwong-Sak Leung
CAV
2005
Springer
122views Hardware» more  CAV 2005»
15 years 6 months ago
Interpolant-Based Transition Relation Approximation
Abstract. In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, sof...
Ranjit Jhala, Kenneth L. McMillan
DAGSTUHL
2007
15 years 2 months ago
An Inner/Outer Stationary Iteration for Computing PageRank
We present a stationary iterative scheme for PageRank computation. The algorithm is based on a linear system formulation of the problem, uses inner/outer iterations, and amounts to...
Andrew P. Gray, Chen Greif, Tracy Lau
116
Voted
SIAMJO
2008
79views more  SIAMJO 2008»
15 years 1 months ago
A Class of Inexact Variable Metric Proximal Point Algorithms
For the problem of solving maximal monotone inclusions, we present a rather general class of algorithms, which contains hybrid inexact proximal point methods as a special case and ...
Lisandro A. Parente, Pablo A. Lotito, Mikhail V. S...
SIAMSC
2008
97views more  SIAMSC 2008»
15 years 1 months ago
Improvement of Space-Invariant Image Deblurring by Preconditioned Landweber Iterations
The Landweber method is a simple and flexible iterative regularization algorithm, whose projected variant provides nonnegative image reconstructions. Since the method is usually v...
Paola Brianzi, Fabio Di Benedetto, Claudio Estatic...