396 search results - page 43 / 80 » Odd Crossing Number Is Not Crossing Number |
MOC
2000
14 years 9 months ago
2000
Seven widely spaced regions of integers with 4,3(x) < 4,1(x) have been discovered using conventional prime sieves. Assuming the generalized Riemann hypothesis, we modify a resul...
114
click to vote
INFOCOM
2012
IEEE
13 years 5 days ago
2012
IEEE
—Developing simple distributed algorithms to allow nodes to perform topology discovery and message routing using incomplete topological information is a problem of great interest...
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
APIN
2010
14 years 10 months ago
2010
Abstract. This paper introduces a robust variant of AdaBoost, cwAdaBoost, that uses weight perturbation to reduce variance error, and is particularly effective when dealing with da...
JGT
2006
14 years 9 months ago
2006
We begin the study of distinguishing geometric graphs. Let G be a geometric graph. An automorphism of the underlying graph that preserves both crossings and noncrossings is called...