484 search results - page 3 / 97 » The number of convex permutominoes |
DCG
2010
13 years 6 months ago
2010
: This paper studies the convex hull of n random points in Rd. A recently-proved topological identity of the author is used in combination with identities of Efron and Buchta to fi...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
COLT
2000
Springer
13 years 10 months ago
2000
Springer
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...
SOFSEM
2005
Springer
13 years 11 months ago
2005
Springer
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
COMPGEOM
2009
ACM
14 years 16 days ago
2009
ACM
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...