557 search results - page 91 / 112 » Visualizing Weighted Edges in Graphs |
COLT
2010
Springer
14 years 9 months ago
2010
Springer
We develop an online algorithm called Component Hedge for learning structured concept classes when the loss of a structured concept sums over its components. Example classes inclu...
117
click to vote
IEICET
2010
14 years 8 months ago
2010
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted compl...
RSS
2007
15 years 14 days ago
2007
Abstract— This paper presents the Discrete Search Leading continuous eXploration (DSLX) planner, a multi-resolution approach to motion planning that is suitable for challenging p...
106
Voted
PR
2007
14 years 10 months ago
2007
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
89
Voted
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...