Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

108

Voted

ESA
2010
Springer

179views Algorithms» more ESA 2010»

On Space Efficient Two Dimensional Range Minimum Data Structures

15 years 3 months ago

On Space Efficient Two Dimensional Range Minimum Data Structures

Download www.cs.au.dk

The two dimensional range minimum query problem is to preprocess a static two dimensional m by n array A of size N = m

Gerth Stølting Brodal, Pooya Davoodi, S. Sr

Real-time Traffic

Additional Space | Algorithms | Dimensional | ESA 2010 | Minimum Query Problem |

claim paper

Related Content

» Data Structures for Range Minimum Queries in Multidimensional Arrays

» Analysis of Minimum Distances in HighDimensional Musical Spaces

» Indexing the Edges A Simple and Yet Efficient Approach to HighDimensional Indexing

» Dynamic HalfSpace Reporting Geometric Optimization and Minimum Spanning Trees

» Efficient kNN search on vertically decomposed data

» Local Dimensionality Reduction A New Approach to Indexing High Dimensional Spaces

» On Optimizing Nearest Neighbor Queries in HighDimensional Data Spaces

» Finding Range Minima in the Middle Approximations and Applications

» Fast HighDimensional Data Search in Incomplete Databases

Post Info
More Details (n/a)

Added	06 Dec 2010
Updated	06 Dec 2010
Type	Conference
Year	2010
Where	ESA
Authors	Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao

Comments (0)