52 search results - page 5 / 11 » A Linear Algorithm for Finding the Invariant Edges of an Edg... |
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
ICIP
2007
IEEE
14 years 10 months ago
2007
IEEE
In this paper, we present a novel active contour model, in which the traditional gradient descent optimization is replaced by graph cut optimization. The basic idea is to first de...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
PVLDB
2010
13 years 7 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, ...