1274 search results - page 187 / 255 » The Geometry of Coin-Weighing Problems |
164
click to vote
COMPGEOM
2006
ACM
16 years 10 days ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
165
click to vote
COMPGEOM
2006
ACM
16 years 10 days ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
148
click to vote
ICDT
2005
ACM
15 years 12 months ago
2005
ACM
Abstract. In this paper, we consider whether traditional index structures are effective in processing unstable nearest neighbors workloads. It is known that under broad conditions...
169
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
170
click to vote
FCT
2003
Springer
15 years 11 months ago
2003
Springer
The purpose of this paper is to investigate the properties of a certain class of highly visible spaces. For a given geometric space C containing obstacles specified by disjoint s...