557 search results - page 94 / 112 » Visualizing Weighted Edges in Graphs |
84
Voted
PODC
2005
ACM
15 years 4 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
ISVC
2009
Springer
15 years 5 months ago
2009
Springer
In this paper, we propose a general-purpose methodology for detecting multiple objects with known visual models from multiple views. The proposed method is based Monte-Carlo sampli...
119
click to vote
CVPR
2001
IEEE
16 years 1 months ago
2001
IEEE
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...
SIGECOM
2010
ACM
15 years 3 months ago
2010
ACM
We study the design of truthful mechanisms that do not use payments for the generalized assignment problem (GAP) and its variants. An instance of the GAP consists of a bipartite g...
COCOON
2001
Springer
15 years 3 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...