26 search results - page 1 / 6 » A tight bound for the number of different directions in thre... |
COMPGEOM
2003
ACM
15 years 4 months ago
2003
ACM
95
Voted
COMPGEOM
2008
ACM
15 years 21 days 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, ...
88
Voted
FOCS
2006
IEEE
15 years 5 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...
85
Voted
SIROCCO
2004
15 years 8 days 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...
78
Voted
CCCG
2009
15 years 15 hour 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...