376 search results - page 48 / 76 » Completely connected clustered graphs |
IPCV
2008
13 years 9 months ago
2008
Minimum spanning tree algorithms have been proposed for the lossy compression of image sets. In these algorithms, a complete graph is constructed from the entire image set and an ...
SIROCCO
2000
13 years 9 months ago
2000
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
ICCV
2007
IEEE
14 years 2 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
AINA
2004
IEEE
13 years 11 months ago
2004
IEEE
Peer-to-peer (P2P) computing offers many attractive features, such as self-organization, load-balancing, availability, fault tolerance, and anonymity. However, it also faces some ...
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
A technique called user views has recently been proposed to focus user attention on relevant information in response to provenance queries over workflow executions [1, 2]: Given u...