557 search results - page 91 / 112 » Visualizing Weighted Edges in Graphs |
136
click to vote
COLT
2010
Springer
15 years 1 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...
148
Voted
IEICET
2010
15 years 21 days 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...
135
Voted
RSS
2007
15 years 4 months 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...
143
Voted
PR
2007
15 years 2 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...
126
click to vote
ICCV
2007
IEEE
16 years 5 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 ...