Results 1  10
of
1,453,171
Exact Matrix Completion via Convex Optimization
, 2008
"... We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover the entries that we have not seen? We show that one can perfe ..."
Abstract

Cited by 873 (26 self)
 Add to MetaCart
We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover the entries that we have not seen? We show that one can
Exact Sampling with Coupled Markov Chains and Applications to Statistical Mechanics
, 1996
"... For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain has ..."
Abstract

Cited by 543 (13 self)
 Add to MetaCart
, and that outputs samples in exact accordance with the desired distribution. The method uses couplings, which have also played a role in other sampling schemes; however, rather than running the coupled chains from the present into the future, one runs from a distant point in the past up until the present, where
An Exact OneDimensional Solution to the Pro
, 1982
"... The research described in this report was funded by ..."
SIMPLE POWER ASSOCIATIVE LOOPS WITH EXACTLY ONE COVERING
"... Abstract. In this paper we look at a some results about uniquely covered power associative loops, and we construct a family of power associative loops that have exactly one covering. This gives shows that there is a wide variety of power associative loops with exactly one covering than groups. 1. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. In this paper we look at a some results about uniquely covered power associative loops, and we construct a family of power associative loops that have exactly one covering. This gives shows that there is a wide variety of power associative loops with exactly one covering than groups. 1.
ON SYMMETRIC MATRICES WITH EXACTLY ONE POSITIVE EIGENVALUE ∗
"... Abstract. We present a class of nonsingular matrices, the MC ′matrices, and prove that the class of symmetric MCmatrices introduced by Shen, Huang and Jing [On inclusion and exclusion intervals for the real eigenvalues of real matrices. SIAM J. Matrix Anal. Appl., 31:816830, 2009] and the class o ..."
Abstract
 Add to MetaCart
of symmetric MC ′matrices are both subsets of the class of symmetric matrices with exactly one positive eigenvalue. Some other sufficient conditions for a symmetric matrix to have exactly one positive eigenvalue are derived.
ON 3COLORED DIGRAPHS WITH EXACTLY ONE NONSINGULAR CYCLE ∗
"... Abstract. The class of connected 3colored digraphs containing exactly one nonsingular cycle is considered in this article. The main objective is to study the smallest Laplacian eigenvalue and the corresponding eigenvectors of such graphs. It is shown that the smallest Laplacian eigenvalue of such a ..."
Abstract
 Add to MetaCart
Abstract. The class of connected 3colored digraphs containing exactly one nonsingular cycle is considered in this article. The main objective is to study the smallest Laplacian eigenvalue and the corresponding eigenvectors of such graphs. It is shown that the smallest Laplacian eigenvalue
Exact Oneway Methods for Acoustic Waveguides
 Mathematics and computers in Simulation 50
, 1999
"... Exact oneway reformulations of the Helmholtz equation are useful for waveguide problems, since the resulting equations can be efficiently solved as "initial" value problems by range marching methods. Some numerical methods for these reformulations are reviewed in this paper. This inc ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Exact oneway reformulations of the Helmholtz equation are useful for waveguide problems, since the resulting equations can be efficiently solved as "initial" value problems by range marching methods. Some numerical methods for these reformulations are reviewed in this paper
INDEFINITE COPOSITIVE MATRICES WITH EXACTLY ONE POSITIVE EIGENVALUE OR EXACTLY ONE NEGATIVE EIGENVALUE
 ELA
, 2013
"... Checking copositivity of a matrix is a coNPcomplete problem. This paper studies copositive matrices with certain spectral properties. It shows that an indefinite matrix with exactly one positive eigenvalue is copositive if and only if the matrix is nonnegative. Moreover, it shows that finding out ..."
Abstract
 Add to MetaCart
Checking copositivity of a matrix is a coNPcomplete problem. This paper studies copositive matrices with certain spectral properties. It shows that an indefinite matrix with exactly one positive eigenvalue is copositive if and only if the matrix is nonnegative. Moreover, it shows that finding out
Efficient exact stochastic simulation of chemical systems with many species and many channels
 J. Phys. Chem. A
, 2000
"... There are two fundamental ways to view coupled systems of chemical equations: as continuous, represented by differential equations whose variables are concentrations, or as discrete, represented by stochastic processes whose variables are numbers of molecules. Although the former is by far more comm ..."
Abstract

Cited by 427 (5 self)
 Add to MetaCart
common, systems with very small numbers of molecules are important in some applications (e.g., in small biological cells or in surface processes). In both views, most complicated systems with multiple reaction channels and multiple chemical species cannot be solved analytically. There are exact numerical
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
in a more gen eral setting? We compare the marginals com puted using loopy propagation to the exact ones in four Bayesian network architectures, including two realworld networks: ALARM and QMR. We find that the loopy beliefs of ten converge and when they do, they give a good approximation
Results 1  10
of
1,453,171