1538 search results - page 95 / 308 » Spectral Techniques in Graph Algorithms |
105
click to vote
ER
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
119
click to vote
WACV
2005
IEEE
15 years 7 months ago
2005
IEEE
We address the problem of clustering of contour images from hardware tools based on string descriptions, in a comparative study of cluster combination techniques. Several clusteri...
121
click to vote
ICALP
2011
Springer
14 years 5 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
105
click to vote
MICCAI
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Graph Cuts have been shown as a powerful interactive segmentation technique in several medical domains. We propose to automate the Graph Cuts in order to automatically se...
SPAA
1992
ACM
15 years 5 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...