499 search results - page 19 / 100 » On the Decay of Crossing Numbers |
COCOA
2007
Springer
14 years 2 months ago
2007
Springer
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
GD
2007
Springer
14 years 2 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...
GD
2007
Springer
14 years 2 months ago
2007
Springer
Let G = (V, E) be a graph with n vertices and m ≥ 4n edges drawn in the plane. The celebrated Crossing Lemma states that G has at least Ω(m3 /n2 ) pairs of crossing edges; or ...
Publication
This study examines the effects of overlapping walking service areas of bus stops on the demand for bus transit. This requires controlling for variation in potential transit demand...
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
In a variety of applications, kernel machines such as Support Vector Machines (SVMs) have been used with great success often delivering stateof-the-art results. Using the kernel t...