Sciweavers

65 search results - page 6 / 13
» A Characterization of Weakly Bipartite Graphs
Sort
View
CORR
2007
Springer
128views Education» more  CORR 2007»
13 years 7 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
WG
1993
Springer
13 years 11 months ago
Dually Chordal Graphs
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...
Andreas Brandstädt, Feodor F. Dragan, Victor ...
FOCM
2007
76views more  FOCM 2007»
13 years 7 months ago
Risk Bounds for Random Regression Graphs
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...
Andrea Caponnetto, Steve Smale
ISAAC
2005
Springer
153views Algorithms» more  ISAAC 2005»
14 years 27 days ago
Network Game with Attacker and Protector Entities
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
COMBINATORICS
2006
130views more  COMBINATORICS 2006»
13 years 7 months ago
Fractional Biclique Covers and Partitions of Graphs
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc(G), and the fractional biclique partition number, bp(G), o...
Valerie L. Watts