320 search results - page 35 / 64 » Overlapping cluster planarity |
UAI
2008
13 years 11 months ago
2008
We introduce Clique Matrices as an alternative representation of undirected graphs, being a generalisation of the incidence matrix representation. Here we use clique matrices to d...
DAM
2006
13 years 9 months ago
2006
Sub-dominant theory provides efficient tools for clustering. However it classically works only for ultrametrics and ad hoc extensions like Jardine and Sibson's 2ultrametrics....
CLUSTER
2011
IEEE
12 years 9 months ago
2011
IEEE
— In this paper, we propose a light-weight asynchronous message progression mechanism for large message transfers in Message Passing Interface (MPI) Rendezvous protocol that is s...
PKDD
2010
Springer
13 years 7 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
ICCV
2009
IEEE
15 years 2 months ago
2009
IEEE
It has recently been shown that deformable 3D surfaces
could be recovered from single video streams. However, ex-
isting techniques either require a reference view in which
the ...