557 search results - page 62 / 112 » Visualizing Weighted Edges in Graphs |
82
Voted
ICIP
2005
IEEE
15 years 4 months ago
2005
IEEE
Fundamental to any graph cut segmentation methods is the assignment of edge weights. The existing solutions typically use gaussian, exponential or rectangular cost functions with ...
100
Voted
DAGM
2007
Springer
15 years 3 months ago
2007
Springer
We address the problem of describing the mean object for a set of planar shapes in the case that the considered dissimilarity measures are semi-metrics, i.e. in the case that the t...
83
Voted
SIGIR
2008
ACM
14 years 11 months ago
2008
ACM
We present a novel passage-based approach to re-ranking documents in an initially retrieved list so as to improve precision at top ranks. While most work on passage-based document...
PVLDB
2010
14 years 9 months ago
2010
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...
ASUNAM
2010
IEEE
15 years 20 days ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...