441 search results - page 13 / 89 » Convex Graph Invariants |
CORR
2011
Springer
12 years 11 months ago
2011
Springer
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
The k-nearest neighbour (kNN) rule is a simple and effective method for multi-way classification that is much used in Computer Vision. However, its performance depends heavily on ...
DCG
2007
13 years 7 months ago
2007
Steinitz’s Theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of ...
FCT
2009
Springer
14 years 2 months ago
2009
Springer
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
