Sciweavers

1105 search results - page 59 / 221
» Linear choosability of graphs
Sort
View
IWQOS
2005
Springer
15 years 5 months ago
Overlay Networks with Linear Capacity Constraints
Abstract. Previous work have assumed an independent model for overlay networks: a graph with independent link capacities. We introduce a model of overlays (LCC-overlay) which incor...
Ying Zhu, Baochun Li
NIPS
2007
15 years 1 months ago
Linear programming analysis of loopy belief propagation for weighted matching
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we investiga...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...
CORR
2010
Springer
228views Education» more  CORR 2010»
14 years 10 months ago
Sparse Inverse Covariance Selection via Alternating Linearization Methods
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse c...
Katya Scheinberg, Shiqian Ma, Donald Goldfarb
ISAAC
1995
Springer
97views Algorithms» more  ISAAC 1995»
15 years 3 months ago
A Linear Time Algorithm For Finding Maximal Planar Subgraphs
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
Wen-Lian Hsu
COLING
1996
15 years 1 months ago
Distributedness and Non-Linearity of LOLITA's Semantic Network
'Phis paper describes SemNet the internal Knowledge t{epresentation lbr LOLI'I'A I. LOMTA is a large scale Natural Language Engineering (NLE) system. As such the in...
S. Short, Simon Shiu, Roberto Garigliano