4201 search results - page 319 / 841 » Interaction graphs: Additives |
175
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
186
click to vote
CCCG
1998
15 years 8 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
178
click to vote
JCT
2006
15 years 6 months ago
2006
We study the Bergman complex B(M) of a matroid M: a polyhedral complex which arises in algebraic geometry, but which we describe purely combinatorially. We prove that a natural su...
198
click to vote
ASE
2004
15 years 6 months ago
2004
The construction of interactive server-side Web applications differs substantially from the construction of traditional interactive programs. In contrast, existing Web programming...
217
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...