Results 11  20
of
1,028,355
Convergence time for unbiased quantized consensus
 Proc. 52nd IEEE Conference on Decision and Control. CDC’13, Dec 1013, 2013
"... We revisit the quantized consensus problem on undirected connected graphs, and obtain some strong results on expected time to convergence. This is unbiased consensus, because the edges emanating from a node have equal probability of being selected. The paper first develops an approach that bounds th ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We revisit the quantized consensus problem on undirected connected graphs, and obtain some strong results on expected time to convergence. This is unbiased consensus, because the edges emanating from a node have equal probability of being selected. The paper first develops an approach that bounds
Determining Lyapunov Exponents from a Time Series
 Physica
, 1985
"... We present the first algorithms that allow the estimation of nonnegative Lyapunov exponents from an experimental time series. Lyapunov exponents, which provide a qualitative and quantitative characterization of dynamical behavior, are related to the exponentially fast divergence or convergence of n ..."
Abstract

Cited by 469 (1 self)
 Add to MetaCart
We present the first algorithms that allow the estimation of nonnegative Lyapunov exponents from an experimental time series. Lyapunov exponents, which provide a qualitative and quantitative characterization of dynamical behavior, are related to the exponentially fast divergence or convergence
Realtime Model and Convergence Time of BGP
, 2002
"... BGP allows routers to use general preference policies for route selection. This paper studies the impact of these policies on convergence time. We first describe a realtime model of BGP. We then state and prove a general theorem providing an upper bound on convergence time. Finally, we show how to ..."
Abstract

Cited by 30 (1 self)
 Add to MetaCart
BGP allows routers to use general preference policies for route selection. This paper studies the impact of these policies on convergence time. We first describe a realtime model of BGP. We then state and prove a general theorem providing an upper bound on convergence time. Finally, we show how
Social change and crime rate trends: a routine activity approach
 American Sociological Review
, 1979
"... In this paper we present a "routine activity approach " for analyzing crime rate trends and cycles. Rather than emphasizing the characteristics of offenders, with this approach we concentrate upon the circumstances in which they carry out predatory criminal acts. Most criminal acts require ..."
Abstract

Cited by 666 (5 self)
 Add to MetaCart
require convergence in space and time of likely offenders, suitable targets and the absence of capable guardians against crime. Human ecological theory facilitates an investigation into the way in which social structure produces this convergence, hence allowing illegal activities to feed upon the legal
IMPROVING THE CONVERGENCE TIME OF HIGHSPEED TCP
"... Abstract It is reported that TCP does not perform well in highspeed and longdistance networks. This problem led to the proposal of HighSpeed TCP (HSTCP). HSTCP is designed to achieve a steadystate throughput of 10 Gbps with a packet loss rate of 107 when the packet size is 1500 bytes and the r ..."
Abstract
 Add to MetaCart
and the round trip time is 100 ms. However, HSTCP has a problem in terms of convergence times. That is, it takes a long time for a new HSTCP flow to achieve fair bandwidth allocation if the existing HSTCP flows have large congestion windows. This paper proposes a new mechanism to improve the convergence time
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
 SIAM Journal on Optimization
, 1993
"... We study the semidefinite programming problem (SDP), i.e the problem of optimization of a linear function of a symmetric matrix subject to linear equality constraints and the additional condition that the matrix be positive semidefinite. First we review the classical cone duality as specialized to S ..."
Abstract

Cited by 544 (12 self)
 Add to MetaCart
to SDP. Next we present an interior point algorithm which converges to the optimal solution in polynomial time. The approach is a direct extension of Ye's projective method for linear programming. We also argue that most known interior point methods for linear programs can be transformed in a
Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules
, 2002
"... In a recent Physical Review Letters paper, Vicsek et. al. propose a simple but compelling discretetime model of n autonomous agents fi.e., points or particlesg all moving in the plane with the same speed but with dierent headings. Each agent's heading is updated using a local rule based on ..."
Abstract

Cited by 1237 (62 self)
 Add to MetaCart
coordination and despite the fact that each agent's set of nearest neighbors change with time as the system evolves. This paper provides a theoretical explanation for this observed behavior. In addition, convergence results are derived for several other similarly inspired models.
Efficient Variants of the ICP Algorithm
 INTERNATIONAL CONFERENCE ON 3D DIGITAL IMAGING AND MODELING
, 2001
"... The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of threedimensional models when an initial estimate of the relative pose is known. Many variants of ICP have been proposed, affecting all phases of the algorithm from the selection and matching of points to the minim ..."
Abstract

Cited by 702 (5 self)
 Add to MetaCart
to the minimization strategy. We enumerate and classify many of these variants, and evaluate their effect on the speed with which the correct alignment is reached. In order to improve convergence for nearlyflat meshes with small features, such as inscribed surfaces, we introduce a new variant based on uniform
The algorithmic analysis of hybrid systems
 THEORETICAL COMPUTER SCIENCE
, 1995
"... We present a general framework for the formal specification and algorithmic analysis of hybrid systems. A hybrid system consists of a discrete program with an analog environment. We model hybrid systems as nite automata equipped with variables that evolve continuously with time according to dynamica ..."
Abstract

Cited by 771 (71 self)
 Add to MetaCart
We present a general framework for the formal specification and algorithmic analysis of hybrid systems. A hybrid system consists of a discrete program with an analog environment. We model hybrid systems as nite automata equipped with variables that evolve continuously with time according
Nonlinear total variation based noise removal algorithms
, 1992
"... A constrained optimization type of numerical algorithm for removing noise from images is presented. The total variation of the image is minimized subject to constraints involving the statistics of the noise. The constraints are imposed using Lagrange multipliers. The solution is obtained using the g ..."
Abstract

Cited by 2249 (51 self)
 Add to MetaCart
the gradientprojection method. This amounts to solving a time dependent partial differential equation on a manifold determined by the constraints. As t ~ 0o the solution converges to a steady state which is the denoised image. The numerical algorithm is simple and relatively fast. The results appear
Results 11  20
of
1,028,355