Sciweavers

2370 search results - page 179 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
87
Voted
CORR
2007
Springer
128views Education» more  CORR 2007»
14 years 10 months ago
Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
Sujay Sanghavi
84
Voted
JCT
2008
84views more  JCT 2008»
14 years 10 months ago
Minimally non-Pfaffian graphs
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
Serguei Norine, Robin Thomas
JMLR
2008
135views more  JMLR 2008»
14 years 10 months ago
Complete Identification Methods for the Causal Hierarchy
We consider a hierarchy of queries about causal relationships in graphical models, where each level in the hierarchy requires more detailed information than the one below. The hie...
Ilya Shpitser, Judea Pearl
115
Voted
JSAC
2006
128views more  JSAC 2006»
14 years 10 months ago
Optimized Transmission for Fading Multiple-Access and Broadcast Channels With Multiple Antennas
In mobile wireless networks, dynamic allocation of resources such as transmit powers, bit-rates, and antenna beams based on the channel state information of mobile users is known t...
Mehdi Mohseni, Rui Zhang, John M. Cioffi
SIAMDM
1998
95views more  SIAMDM 1998»
14 years 9 months ago
The Graphs with All Subgraphs T-Perfect
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
A. M. H. Gerards, F. Bruce Shepherd