184 search results - page 7 / 37 » Cache-oblivious data structures for orthogonal range searchi... |
131
Voted
WADS
2007
Springer
15 years 3 months ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
The mode of a multiset of labels, is a label that occurs at least as often as any other label. The input to the range mode problem is an array A of size n. A range query [i, j] mus...
76
Voted
CCCG
2010
14 years 11 months ago
2010
In this paper, we consider a special type of triangular range search for a planar point set S in the I/O-model. Here, two sides of the query triangle are parallel to the coordinat...
ESA
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
77
Voted
IPPS
1997
IEEE
15 years 1 months ago
1997
IEEE
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...