973 search results - page 35 / 195 » New Bounds on Crossing Numbers |
127
click to vote
JGAA
2006
15 years 1 months ago
2006
Visualization of circuits is an important research area in electronic design automation. One commonly accepted method to visualize a circuit aligns the gates to layers and uses or...
124
click to vote
ISAAC
2005
Springer
15 years 7 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...
116
click to vote
COMGEO
2011
ACM
14 years 9 months ago
2011
ACM
A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum ...
108
click to vote
STOC
2000
ACM
15 years 6 months ago
2000
ACM
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input,...
COLT
2005
Springer
15 years 7 months ago
2005
Springer
We present a new generalization bound where the use of unlabeled examples results in a better ratio between training-set size and the resulting classifier’s quality and thus red...