281 search results - page 9 / 57 » On Embedding a Graph on Two Sets of Points |
GD
2007
Springer
15 years 3 months ago
2007
Springer
We consider the following problem known as simultaneous geometric graph embedding (SGE). Given a set of planar graphs on a shared vertex set, decide whether the vertices can be pla...
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and pra...
JCO
2006
14 years 9 months ago
2006
In this paper, we present a combinatorial theorem on labeling disjoint axis-parallel squares of edge length two using points. Given an arbitrary set of disjoint axis-parallel squar...
EJC
2007
14 years 9 months ago
2007
Consider a polar space S weakly embedded in a projective space P. A secant of S is the intersection of the point set of S with a line of P spanned by two non-collinear points of S...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...