Results 1  10
of
7,477
General methods for monitoring convergence of iterative simulations
 J. Comput. Graph. Statist
, 1998
"... We generalize the method proposed by Gelman and Rubin (1992a) for monitoring the convergence of iterative simulations by comparing between and within variances of multiple chains, in order to obtain a family of tests for convergence. We review methods of inference from simulations in order to develo ..."
Abstract

Cited by 551 (8 self)
 Add to MetaCart
to develop convergencemonitoring summaries that are relevant for the purposes for which the simulations are used. We recommend applying a battery of tests for mixing based on the comparison of inferences from individual sequences and from the mixture of sequences. Finally, we discuss multivariate analogues
HOMOGENIZATION AND TWOSCALE CONVERGENCE
, 1992
"... Following an idea of G. Nguetseng, the author defines a notion of "twoscale" convergence, which is aimed at a better description of sequences of oscillating functions. Bounded sequences in L2(f) are proven to be relatively compact with respect to this new type of convergence. A corrector ..."
Abstract

Cited by 451 (14 self)
 Add to MetaCart
Following an idea of G. Nguetseng, the author defines a notion of "twoscale" convergence, which is aimed at a better description of sequences of oscillating functions. Bounded sequences in L2(f) are proven to be relatively compact with respect to this new type of convergence. A corrector
On a combinatorial property of families of sequences converging to ∞
, 1995
"... We consider families Φ of sequences converging to ∞, with the property that for every open set U ⊆R that is unbounded above there exists a sequence belonging to Φ, which has an infinite number of terms belonging to U. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We consider families Φ of sequences converging to ∞, with the property that for every open set U ⊆R that is unbounded above there exists a sequence belonging to Φ, which has an infinite number of terms belonging to U.
A NEW POLYNOMIALTIME ALGORITHM FOR LINEAR PROGRAMMING
 COMBINATORICA
, 1984
"... We present a new polynomialtime algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than the ell ..."
Abstract

Cited by 860 (3 self)
 Add to MetaCart
', containing P ' to the radius of the largest sphere with center a ' contained in P ' is O(n). The algorithm consists of repeated application of such projective transformations each followed by optimization over an inscribed sphere to create a sequence of points which converges to the optimal
Letter No GenomeWide Protein Sequence Convergence for
"... Toothed whales and two groups of bats independently acquired echolocation, the ability to locate and identify objects by reflected sound. Echolocation requires physiologically complex and coordinated vocal, auditory, and neural functions, but the molecular basis of the capacity for echolocation is n ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
convergence. Together, these findings indicate that the reported genomic signatures of convergence largely reflect the background level of sequence convergence unrelated to the origins of echolocation. Key words: bat, dolphin, convergent evolution, neutral evolution. Echolocation originated independently
GROUP TOPOLOGIES ON THE COMPLEX NUMBERS WHICH MAKE CERTAIN GEOMETRIC SEQUENCES CONVERGE
"... Group topologies on the complex numbers which make certain geometric sequences converge (Unsolved Problems and its ..."
Abstract
 Add to MetaCart
Group topologies on the complex numbers which make certain geometric sequences converge (Unsolved Problems and its
Blind Adaptive Multiuser Detection
 IEEE TRANS. INFORM. THEORY
, 1995
"... The decorrelating detector and the linear minimum meansquare error (MMSE) detector are known to be effective strategies to counter the presence of multiuser interference in codedivision multipleaccess channels; in particular, those multiuser detectors provide optimum nearfar resistance. When tr ..."
Abstract

Cited by 353 (16 self)
 Add to MetaCart
training data sequences are available, the MMSE multiuser detector can be implemented adaptively without knowledge of signature waveforms or received amplitudes. This paper introduces an adaptive multiuser detector which converges (for any initialization) to the MMSE detector without requiring training
Weak Convergence And Optimal Scaling Of Random Walk Metropolis Algorithms
, 1994
"... This paper considers the problem of scaling the proposal distribution of a multidimensional random walk Metropolis algorithm, in order to maximize the efficiency of the algorithm. The main result is a weak convergence result as the dimension of a sequence of target densities, n, converges to infinit ..."
Abstract

Cited by 280 (34 self)
 Add to MetaCart
This paper considers the problem of scaling the proposal distribution of a multidimensional random walk Metropolis algorithm, in order to maximize the efficiency of the algorithm. The main result is a weak convergence result as the dimension of a sequence of target densities, n, converges
Classifying Facial Actions
 IEEE Trans. Pattern Anal and Machine Intell
, 1999
"... AbstractÐThe Facial Action Coding System (FACS) [23] is an objective method for quantifying facial movement in terms of component actions. This system is widely used in behavioral investigations of emotion, cognitive processes, and social interaction. The coding is presently performed by highly trai ..."
Abstract

Cited by 341 (36 self)
 Add to MetaCart
trained human experts. This paper explores and compares techniques for automatically recognizing facial actions in sequences of images. These techniques include analysis of facial motion through estimation of optical flow; holistic spatial analysis, such as principal component analysis, independent
On Projection Algorithms for Solving Convex Feasibility Problems
, 1996
"... Due to their extraordinary utility and broad applicability in many areas of classical mathematics and modern physical sciences (most notably, computerized tomography), algorithms for solving convex feasibility problems continue to receive great attention. To unify, generalize, and review some of the ..."
Abstract

Cited by 331 (43 self)
 Add to MetaCart
of these algorithms, a very broad and flexible framework is investigated . Several crucial new concepts which allow a systematic discussion of questions on behaviour in general Hilbert spaces and on the quality of convergence are brought out. Numerous examples are given. 1991 M.R. Subject Classification. Primary 47H
Results 1  10
of
7,477