409 search results - page 19 / 82 » Odd Crossing Number and Crossing Number Are Not the Same |
GD
2007
Springer
14 years 1 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 ...
SWAT
1998
Springer
13 years 11 months ago
1998
Springer
Let C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. Let U den...
NIPS
2004
13 years 9 months ago
2004
We propose to selectively remove examples from the training set using probabilistic estimates related to editing algorithms (Devijver and Kittler, 1982). This heuristic procedure ...
COMPGEOM
2000
ACM
13 years 12 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
GLOBECOM
2008
IEEE
13 years 7 months ago
2008
IEEE
Abstract--Current implementations of BitTorrent-like P2P applications ignore the underlying Internet topology hence incur a large amount of traffic both inside an Internet Service ...