441 search results - page 23 / 89 » Convex Graph Invariants |
SODA
2003
ACM
13 years 9 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
NIPS
2001
13 years 9 months ago
2001
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
GD
2006
Springer
13 years 11 months ago
2006
Springer
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Relational data appear frequently in many machine learning applications. Relational data consist of the pairwise relations (similarities or dissimilarities) between each pair of i...
VC
1998
13 years 7 months ago
1998
Polyhedron realization is the transformation of a polyhedron into a convex polyhedron with an isomorphic vertex neighborhood graph. We present in this paper a novel algorithm for ...