501 search results - page 21 / 101 » An Upper Bound on the Number of Rectangulations of a Point S... |
COMGEO
2002
ACM
13 years 7 months ago
2002
ACM
A fractal construction shows that, for any > 0, the -skeleton of a point set can have arbitrarily large dilation: (nc ), where c is a constant depending on and going to zero ...
COMPGEOM
2010
ACM
14 years 19 days ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
IJAC
2007
13 years 7 months ago
2007
Abstract. Rotation distance quantifies the difference in shape between two rooted binary trees of the same size by counting the minimum number of elementary changes needed to tra...
DCG
2007
13 years 7 months ago
2007
In this paper we investigate the Erd¨os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We pr...