Results 1  10
of
2,209,322
Constructing Free Energy Approximations and Generalized Belief Propagation Algorithms
 IEEE Transactions on Information Theory
, 2005
"... Important inference problems in statistical physics, computer vision, errorcorrecting coding theory, and artificial intelligence can all be reformulated as the computation of marginal probabilities on factor graphs. The belief propagation (BP) algorithm is an efficient way to solve these problems t ..."
Abstract

Cited by 585 (13 self)
 Add to MetaCart
that is exact when the factor graph is a tree, but only approximate when the factor graph has cycles. We show that BP fixed points correspond to the stationary points of the Bethe approximation of the free energy for a factor graph. We explain how to obtain regionbased free energy approximations that improve
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 758 (41 self)
 Add to MetaCart
Binary Decision Diagrams (Bryant, R. E., 1986, IEEE Trans. Comput. C35) to represent relations and formulas. We then show how our new MuCalculus model checking algorithm can be used to derive efficient decision procedures for CTL model checking, satistiability of lineartime temporal logic formulas
Laplacian eigenmaps and spectral techniques for embedding and clustering.
 Proceeding of Neural Information Processing Systems,
, 2001
"... Abstract Drawing on the correspondence between the graph Laplacian, the LaplaceBeltrami op erator on a manifold , and the connections to the heat equation , we propose a geometrically motivated algorithm for constructing a representation for data sampled from a low dimensional manifold embedded in ..."
Abstract

Cited by 668 (7 self)
 Add to MetaCart
retrieval and data mining, one is often confronted with intrinsically low dimensional data lying in a very high dimensional space. For example, gray scale n x n images of a fixed object taken with a moving camera yield data points in rn: n2 . However , the intrinsic dimensionality of the space of all images
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
. That is, we replaced the reference to >.� ) in and similarly for 11"�) in Equation 3, where 0 :::; J.l :::; 1 is the momentum term. It is easy to show that if the modified system of equations converges to a fixed point F, then F is also a fixed point of the original system (since if>.� ) = >
Capacity of a Mobile MultipleAntenna Communication Link in Rayleigh Flat Fading
"... We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flatfading environment. The propagation coefficients between every pair of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence int ..."
Abstract

Cited by 495 (22 self)
 Add to MetaCart
independent matrices: a T T isotropically distributed unitary matrix times a certain T M random matrix that is diagonal, real, and nonnegative. This result enables us to determine capacity for many interesting cases. We conclude that, for a fixed number of antennas, as the length of the coherence interval
Synthesis of FixedPoint Programs ABSTRACT
"... Several problems in the implementations of control systems, signalprocessing systems, and scientific computing systems reduce to compiling a polynomial expression over the reals into an imperative program using fixedpoint arithmetic. Fixedpoint arithmetic only approximates real values, and its op ..."
Abstract
 Add to MetaCart
Several problems in the implementations of control systems, signalprocessing systems, and scientific computing systems reduce to compiling a polynomial expression over the reals into an imperative program using fixedpoint arithmetic. Fixedpoint arithmetic only approximates real values, and its
The Determinants of Credit Spread Changes.
 Journal of Finance
, 2001
"... ABSTRACT Using dealer's quotes and transactions prices on straight industrial bonds, we investigate the determinants of credit spread changes. Variables that should in theory determine credit spread changes have rather limited explanatory power. Further, the residuals from this regression are ..."
Abstract

Cited by 422 (2 self)
 Add to MetaCart
, Stanton, and Whitelaw (1997), who find that a 3factor model explains over 90 percent of Ginnie Mae yields, but that the remaining variation apparently cannot be explained by the changes in the yield curve. 2 In contrast, our multiplefactor model explains only about onequarter of the variation in credit
Formalization of FixedPoint Arithmetic in HOL
, 2005
"... This paper addresses the formalization in higherorder logic of fixedpoint arithmetic. We encoded the fixedpoint number system and specified the different quantization modes in fixedpoint arithmetic such as the directed and even quantization modes. We also considered the formalization of except ..."
Abstract
 Add to MetaCart
This paper addresses the formalization in higherorder logic of fixedpoint arithmetic. We encoded the fixedpoint number system and specified the different quantization modes in fixedpoint arithmetic such as the directed and even quantization modes. We also considered the formalization
FixedPoint Model For Structured Labeling
"... In this paper, we propose a simple but effective solution to the structured labeling problem: a fixedpoint model. Recently, layered models with sequential classifiers/regressors have gained an increasing amount of interests for structural prediction. Here, we design an algorithm with a new perspect ..."
Abstract
 Add to MetaCart
In this paper, we propose a simple but effective solution to the structured labeling problem: a fixedpoint model. Recently, layered models with sequential classifiers/regressors have gained an increasing amount of interests for structural prediction. Here, we design an algorithm with a new
FixedPoint Arithmetic Line Clipping
, 2003
"... This algorithm supports line clipping against a rectangular window with edges parallel to the screen. The algorithm combines different partial solutions given in the bibliography such as implicit area codes, decision trees, line ends comparison, symmetry or avoiding redundant calculations, mixing th ..."
Abstract
 Add to MetaCart
them with fixedpoint arithmetic, explicit calculation reusing and dynamic monitoring. It may work in the fractional object space while still using integer arithmetic (fixedpoint). It is faster than traditional algorithms. It provides more precision without using floating point arithmetic.
Results 1  10
of
2,209,322