973 search results - page 19 / 195 » New Bounds on Crossing Numbers |
COLT
1999
Springer
13 years 11 months ago
1999
Springer
—Support vector (SV) machines are linear classifiers that use the maximum margin hyperplane in a feature space defined by a kernel function. Until recently, the only bounds on th...
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 ...
JAL
2006
13 years 7 months ago
2006
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...
COMPGEOM
1996
ACM
13 years 11 months ago
1996
ACM
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...
STACS
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...