Results 1  10
of
36,048
ON STATISTICAL LIMIT POINTS
, 2000
"... Abstract. The set of all statistical limit points of a given sequence xn is characterized as an Fσset. It is also characterized in terms of discontinuity points of distribution functions of xn. ..."
Abstract
 Add to MetaCart
Abstract. The set of all statistical limit points of a given sequence xn is characterized as an Fσset. It is also characterized in terms of discontinuity points of distribution functions of xn.
The large N limit of superconformal field theories and supergravity
, 1998
"... We show that the large N limit of certain conformal field theories in various dimensions include in their Hilbert space a sector describing supergravity on the product of AntideSitter spacetimes, spheres and other compact manifolds. This is shown by taking some branes in the full M/string theory and ..."
Abstract

Cited by 5631 (20 self)
 Add to MetaCart
in the superconformal group (as opposed to just the superPoincare group). The ’t Hooft limit of 3+1 N = 4 superYangMills at the conformal point is shown to contain strings: they are IIB strings. We conjecture that compactifications of M/string theory on various AntideSitter spacetimes is dual to various conformal
LIMIT POINTS FOR NORMALIZED LAPLACIAN EIGENVALUES ∗
"... Abstract. Limit points for the positive eigenvalues of the normalized Laplacian matrix of a graph are considered.Specifically, it is shown that the set of limit points for the jth smallest such eigenvalues is equal to [0, 1], while the set of limit points for the jth largest such eigenvalues is eq ..."
Abstract
 Add to MetaCart
Abstract. Limit points for the positive eigenvalues of the normalized Laplacian matrix of a graph are considered.Specifically, it is shown that the set of limit points for the jth smallest such eigenvalues is equal to [0, 1], while the set of limit points for the jth largest such eigenvalues
LIMIT POINTS OF COMMUTING SQUARES
"... Abstract. In an attempt to understand the structure of the moduli space of commuting squares, we ask the question: when is a commuting square C a limit of nonisomorphic commuting squares? We present necessary second order conditions on such a C. We give an application to the classification of comp ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. In an attempt to understand the structure of the moduli space of commuting squares, we ask the question: when is a commuting square C a limit of nonisomorphic commuting squares? We present necessary second order conditions on such a C. We give an application to the classification
On the limit points of discrete selection dynamics
 Journal of Economic Theory
, 1992
"... This paper provides an analog to the aggregate monotonicity condition introduced by Samuelson and Zhang [J..&on. Theory, 19921 in a study of continuous dynamics. Our condition guarantees that limit points of discrete selection dynamics are rationalizable strategies. We show that the condition wi ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
This paper provides an analog to the aggregate monotonicity condition introduced by Samuelson and Zhang [J..&on. Theory, 19921 in a study of continuous dynamics. Our condition guarantees that limit points of discrete selection dynamics are rationalizable strategies. We show that the condition
Limit points of the monotonic schemes
, 2005
"... Abstract — Many numerical simulations in quantum (bilinear) control use the monotonically convergent algorithms of Krotov (introduced by Tannor in [12]), Zhu & Rabitz ([11]) or the general form of Maday & Turinici ([13]). This paper presents an analysis of the limit set of controls provided ..."
Abstract
 Add to MetaCart
Abstract — Many numerical simulations in quantum (bilinear) control use the monotonically convergent algorithms of Krotov (introduced by Tannor in [12]), Zhu & Rabitz ([11]) or the general form of Maday & Turinici ([13]). This paper presents an analysis of the limit set of controls provided
Limit points of lines of minima
"... Caroline Series Abstract Given two measured laminations and in a hyperbolic surface which ll up the surface, Kerckho [8] denes an associated line of minima along which convex combinations of the length functions of and are minimised. This is a line in Teichmüller space which can be thought as ..."
Abstract
 Add to MetaCart
as analogous to the geodesic in hyperbolic space determined by two points at in nity. We show that when is uniquely ergodic, this line converges to the projective lamination [] , but that when is rational, the line converges not to [] , but rather to the barycentre of the support of . Similar results
On the Limit Points of Discrete Selection Dynamics
, 1991
"... This paper provides an analog to the aggregate monotonicity condition introduced by Samuelson and Zhang [9] in a study of continuous dynamics. Our condition guarantees that limit points of discrete selection dynamics are rationalizable strategies. We show that the condition will be satisfied by the ..."
Abstract
 Add to MetaCart
This paper provides an analog to the aggregate monotonicity condition introduced by Samuelson and Zhang [9] in a study of continuous dynamics. Our condition guarantees that limit points of discrete selection dynamics are rationalizable strategies. We show that the condition will be satisfied
Convergent Treereweighted Message Passing for Energy Minimization
 ACCEPTED TO IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (PAMI), 2006. ABSTRACTACCEPTED TO IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (PAMI)
, 2006
"... Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33] treereweighted maxproduct message passing (TRW). It was inspired by the problem of maximizing a lower bound on the energy ..."
Abstract

Cited by 489 (16 self)
 Add to MetaCart
not to decrease. We also give a weak tree agreement condition which characterizes local maxima of the bound with respect to TRW algorithms. We prove that our algorithm has a limit point that achieves weak tree agreement. Finally, we show that our algorithm requires half as much memory as traditional message
Results 1  10
of
36,048