Results 1  10
of
66
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
with loops (undirected cycles). The algorithm is an exact inference algorithm for singly connected networks the beliefs converge to the cor rect marginals in a number of iterations equal to the diameter of the graph.1 However, as Pearl noted, the same algorithm will not give the correct beliefs for mul
Crossing Number Bounds for the Twisted Cube
, 2001
"... The twisted cube TQ d is formed from the ddimensional hypercube Q d by `twisting' a pair of independent edges of any 4cycle of Q d . Asymptotic upper and lower bounds for the crossing numbers of the twisted cube and generalized twisted cube (GTQ d ) graphs are derived. We also determine the s ..."
Abstract
 Add to MetaCart
The twisted cube TQ d is formed from the ddimensional hypercube Q d by `twisting' a pair of independent edges of any 4cycle of Q d . Asymptotic upper and lower bounds for the crossing numbers of the twisted cube and generalized twisted cube (GTQ d ) graphs are derived. We also determine
Topological properties of some interconnection network graphs
 CONGRESSUS NUMERANTIUM
, 1996
"... Interconnection networks play a vital role in parallel computing architectures. We investigate topological properties of some networks proposed for parallel computation, based on their underlying graph models. The vertices of the graph correspond to processors and the edges represent communication l ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
links between processors. Parameters such as crossing number and thickness strongly affect the area required to lay out the corresponding circuit on a VLSI chip. In particular, we give upper bounds for the skewness, crossing number, and thickness of several networks including the mesh of trees, reduced
Pfaffian orientation and enumeration of perfect matchings for some Cartesian products of graphs
 ELECTRONIC J. COMBIN
, 2009
"... The importance of Pfaffian orientations stems from the fact that if a graph G is Pfaffian, then the number of perfect matchings of G (as well as other related problems) can be computed in polynomial time. Although there are many equivalent conditions for the existence of a Pfaffian orientation of a ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
known that the enumeration problem of perfect matchings for general graphs is NPhard. L. Lovász pointed out that it makes sense not only to seek good upper and lower bounds of the number of perfect matchings for general graphs, but also to seek special classes for which the problem can be solved
The Boundary of Young Lattice and Random Young Tableaux
, 1994
"... The description of characters of the infinite symmetric group S1 = lim \Gamma! Sn is considered in the paper as an asymptotical combinatorial problem. It is equivalent to the characterization problem of totally positive sequences. We derive the list of characters, first obtained by E. Thoma i ..."
Abstract

Cited by 26 (3 self)
 Add to MetaCart
general problem in potential theory on a graph, namely that of the explicite description of Martin boundary of this graph. We show that Selberg type integrals arise naturally in this general setup in connection with Pieri formula for Jack symmetric polynomials. Some remarkable connections between
including © notice, is given to the source. Banking System Stability: A CrossAtlantic Perspective
, 2005
"... Paper prepared for the NBER project on “Risks of Financial Institutions”. We benefited from suggestions and criticism by many participants in the NBER project on “Risks of financial institutions”, in particular by the organizers Mark Carey (also involving Dean Amel and Allen Berger) and Rene Stulz, ..."
Abstract
 Add to MetaCart
Paper prepared for the NBER project on “Risks of Financial Institutions”. We benefited from suggestions and criticism by many participants in the NBER project on “Risks of financial institutions”, in particular by the organizers Mark Carey (also involving Dean Amel and Allen Berger) and Rene Stulz, by our discussant Tony Saunders and by Patrick de Fontnouvelle, Gary Gorton, Andy Lo, Jim O’Brien and Eric Rosengren. Furthermore, we are grateful for comments we received at the 2004 European Finance Association Meetings in Maastricht, in particular by our discussant Marco da Rin and by Christian Upper, at the 2004 Ottobeuren seminar in economics, notably the thoughts of our discussant Ernst Baltensberger, of Friedrich Heinemann and of Gerhard Illing, as well as at seminars of the Max Planck Institute for Research on Collective Goods, the Federal Reserve Bank of St. Louis, the ECB and the University of Frankfurt. Gabe de Bondt and David Marques Ibanez supported us enormously in finding yield spread data, Lieven Baele and Richard Stehle kindly made us aware of pitfalls in Datastream equity data. Very helpful research assistance by Sandrine Corvoisier, Peter Galos and Marco Lo Duca as well as editorial support by Sabine Wiedemann are gratefully acknowledged. Any views expressed only reflect those of the authors and should not be interpreted as the ones of the ECB or the Eurosystem. The views expressed herein are those of the author(s) and do not necessarily reflect the views of the National Bureau of Economic Research.
WIRE REDUNDANCY IN BUS ENCODING TECHNIQUES FOR FORBIDDEN TRANSITIONS FREE CROSS TALK AVOIDANCE CODEC DESIGNS
"... A simple technique to eliminate crosstalk delay in DSM Technology is by placing a shielding wire between every adjacent wire. But this technique has a drawback of doubling the wiring area. Several Bus Encoding Techniques have been proposed by several authors to eliminate/reduce crosstalk delay in VL ..."
Abstract
 Add to MetaCart
in VLSI inter connects without placing a shielding wires. Some of these methods are based on routing strategies, which employ various routing techniques to minimize crosstalk delay within a datapath or logic block. The main idea is to prevent simultaneous opposite transitions by skewing signal transition
Prepared by:
"... Large numbers of spurdog were caught during the first sampling trip, with 217 tagged with Petersen discs and released. The second sampling trip yielded few spurdog, although catches at that time of year are known to be small. Spurdog were not observed on the first three days of the third trip, but r ..."
Abstract
 Add to MetaCart
, but reasonable numbers were captured on the last day, just off the Mull of Galloway. The fourth trip (late October to early December) yielded some reasonably large catches of spurdog from the grounds just off Anglesey. The spurdog caught were generally in good condition, although the bait stripper can damage
Drawing Recurrent Hierarchies
, 2012
"... Directed graphs are generally drawn as level drawings using the hierarchical approach. Such drawings are constructed by a framework of algorithms which operates in four phases: cycle removal, leveling, crossing reduction, and coordinate assignment. However, there are situations where cycles should b ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Directed graphs are generally drawn as level drawings using the hierarchical approach. Such drawings are constructed by a framework of algorithms which operates in four phases: cycle removal, leveling, crossing reduction, and coordinate assignment. However, there are situations where cycles should
Results 1  10
of
66