463 search results - page 59 / 93 » A General Framework for Graph Sparsification |
175
Voted
CLA
2007
15 years 5 months ago
2007
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
115
Voted
WWW
2005
ACM
16 years 4 months ago
2005
ACM
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
118
click to vote
HM
2007
Springer
15 years 9 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
157
click to vote
CORR
2007
Springer
15 years 3 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...
151
Voted
SAS
2007
Springer
15 years 9 months ago
2007
Springer
We present a framework for inductive definitions in the logic of bunched implications, BI, and formulate two sequent calculus proof systems for inductive reasoning in this framewo...