91 search results - page 10 / 19 » A supertree method for rooted trees |
HM
2007
Springer
15 years 6 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 ⊆...
118
Voted
ECSQARU
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. Given several Dempster-Shafer belief functions, the framework of valuation networks describes an efficient method for computing the marginal of the combined belief functi...
117
Voted
ACL
2011
14 years 4 months ago
2011
Graph-based dependency parsing can be sped up significantly if implausible arcs are eliminated from the search-space before parsing begins. State-of-the-art methods for arc filt...
110
Voted
ATAL
2009
Springer
15 years 7 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
82
Voted
IV
2005
IEEE
15 years 6 months ago
2005
IEEE
The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge repulsion. In this paper, we propose a new force-d...