26 search results - page 1 / 6 » A tight bound for the number of different directions in thre... |
COMPGEOM
2003
ACM
14 years 21 days ago
2003
ACM
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
The study of extremal problems on triangle areas was initiated in a series of papers by Erdos and Purdy in the early 1970s. In this paper we present new results on such problems, ...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
SIROCCO
2004
13 years 8 months ago
2004
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
CCCG
2009
13 years 8 months ago
2009
Given a set of blue points and a set of red points in ddimensional space, we show how to find an axis-aligned hyperrectangle that contains no red points and as many blue points as...