Results 1  10
of
432
Fast linear iterations for distributed averaging.
 Systems & Control Letters,
, 2004
"... Abstract We consider the problem of finding a linear iteration that yields distributed averaging consensus over a network, i.e., that asymptotically computes the average of some initial values given at the nodes. When the iteration is assumed symmetric, the problem of finding the fastest converging ..."
Abstract

Cited by 433 (12 self)
 Add to MetaCart
be exploited to speed up interiorpoint methods for solving the fastest distributed linear iteration problem, for networks with up to a thousand or so edges. We also describe a simple subgradient method that handles far larger problems, with up to one hundred thousand edges. We give several extensions
MAFFT version 5: improvement in accuracy of multiple sequence alignment
 NUCLEIC ACIDS RES
, 2005
"... The accuracy of multiple sequence alignment program MAFFT has been improved. The new version (5.3) of MAFFT offers new iterative refinement options, HINSi, FINSi and GINSi, in which pairwise alignment information are incorporated into objective function. These new options of MAFFT showed high ..."
Abstract

Cited by 801 (5 self)
 Add to MetaCart
The accuracy of multiple sequence alignment program MAFFT has been improved. The new version (5.3) of MAFFT offers new iterative refinement options, HINSi, FINSi and GINSi, in which pairwise alignment information are incorporated into objective function. These new options of MAFFT showed
A Fast Algorithm for the Minimum Covariance Determinant Estimator
 Technometrics
, 1998
"... The minimum covariance determinant (MCD) method of Rousseeuw (1984) is a highly robust estimator of multivariate location and scatter. Its objective is to find h observations (out of n) whose covariance matrix has the lowest determinant. Until now applications of the MCD were hampered by the comput ..."
Abstract

Cited by 346 (15 self)
 Add to MetaCart
by the computation time of existing algorithms, which were limited to a few hundred objects in a few dimensions. We discuss two important applications of larger size: one about a production process at Philips with n = 677 objects and p = 9 variables, and a data set from astronomy with n =137,256 objects and p = 27
ITERATION, ITERATIVE ROOTS AND ITERATIVE EQUATIONS
"... Abstract. Iteration exists extensively in the nature. Iteration of a homeomorphism generates a dynamical system. To embed such a homeomorphism into a flow we need to define fractional iteration and find iterative roots. The problem of iterative roots is to discuss iterative equations. This is a way ..."
Abstract
 Add to MetaCart
way to lead us to explore the mathematics of iteration. Iteration is a basic concept in the theory of dynamical systems. Over a hundred years ago E. Schröder, N. H. Abel, and C. Babbage studied iteration and obtained many nice results [20, 1, 4]. With iteration we trace where an object will go under
Pose estimation from corresponding point data
 IEEE Transactions on Systems, Man and Cybernetics
, 1989
"... AbstracrSolutions for four different pose estimation problems are presented. Closed form leastsquares solutions are given to the over constrained ZDZD and 3D3D pose estimation problems. A globally convergent iterative technique is given for the 2D perspective projection3D pose estimation ..."
Abstract

Cited by 199 (2 self)
 Add to MetaCart
AbstracrSolutions for four different pose estimation problems are presented. Closed form leastsquares solutions are given to the over constrained ZDZD and 3D3D pose estimation problems. A globally convergent iterative technique is given for the 2D perspective projection3D pose estimation
An efficient program for manybody simulation
 SIAM J. Sci. and Stat. Comput
, 1985
"... Abstract. The simulation of N particles interacting in a gravitational force field is useful in astrophysics, but such simulations become costly for large N. Representing the universe as a tree structure with the particles at the leaves and internal nodes labeled with the centers of mass of their de ..."
Abstract

Cited by 166 (0 self)
 Add to MetaCart
modifications. The changes reduced the running time of a large problem (N 10,000) by a factor of four hundred. This paper describes both the particular program and the methodology underlying such speedups. 1. Introduction. Isaac Newton calculated the behavior of two particles interacting through the force
Efficient Computation of PageRank
, 1999
"... This paper discusses efficient techniques for computing PageRank, a ranking metric for hypertext documents. We show that PageRank can be computed for very large subgraphs of the web (up to hundreds of millions of nodes) on machines with limited main memory. Runningtime measurements on various memor ..."
Abstract

Cited by 153 (7 self)
 Add to MetaCart
This paper discusses efficient techniques for computing PageRank, a ranking metric for hypertext documents. We show that PageRank can be computed for very large subgraphs of the web (up to hundreds of millions of nodes) on machines with limited main memory. Runningtime measurements on various
A Multigrid Method Enhanced By Krylov Subspace Iteration For Discrete Helmholtz Equations
, 1999
"... Standard multigrid algorithms have proven ineffective for the solution of discretizations of Helmholtz equations. In this work we modify the standard algorithm by adding GMRES iterations at coarse levels and as an outer iteration. We demonstrate the algorithm's effectiveness through theoretical ..."
Abstract

Cited by 79 (4 self)
 Add to MetaCart
theoretical analysis of a model problem and experimental results. In particular, we show that the combined use of GMRES as a smoother and outer iteration produces an algorithm whose performance depends relatively mildly on wave number and is robust for normalized wave numbers as large as two hundred
Phase retrieval by iterated projections
 J. Opt. Soc. Amer. A
, 2003
"... Several strategies in phase retrieval are unified by an iterative “difference map” constructed from a pair of elementary projections and a single real parameter β. For the standard application in optics, where the two projections implement Fourier modulus and object support constraints respectively, ..."
Abstract

Cited by 29 (2 self)
 Add to MetaCart
Several strategies in phase retrieval are unified by an iterative “difference map” constructed from a pair of elementary projections and a single real parameter β. For the standard application in optics, where the two projections implement Fourier modulus and object support constraints respectively
An Iterative Approach to Area and Performance Optimization for Superscalar Processors
, 2006
"... When designing embedded systems, one needs to make decisions concerning the different components that will be included in a microprocessor. An important issue in this phase is the chip area vs. performance tradeoff. In this paper we investigate the relationship between chip area and performance for ..."
Abstract
 Add to MetaCart
for superscalar microprocessors. We evaluate how one can obtain a suitable configuration by using an approach that is based on iterative compilation. It turns out that our approach returns a reasonably suitable configuration after a few hundred iterations. We investigate if this approach is feasible enough
Results 1  10
of
432