Sciweavers

73 search results - page 1 / 15
» Data Structures for Range Minimum Queries in Multidimensiona...
Sort
View
SODA
2010
ACM
409views Algorithms» more  SODA 2010»
14 years 2 months ago
Data Structures for Range Minimum Queries in Multidimensional Arrays
Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous subarray of A. The 1D RMQ problem has been studied int...
Hao Yuan, Mikhail J. Atallah
ESA
2010
Springer
179views Algorithms» more  ESA 2010»
13 years 5 months ago
On Space Efficient Two Dimensional Range Minimum Data Structures
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...
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 5 months ago
Multidimensional Data Structures and Techniques for Efficient Decision Making
: - In this paper we present several novel efficient techniques and multidimensional data structures which can improve the decision making process in many domains. We consider onli...
Madalina Ecaterina Andreica, Mugurel Ionut Andreic...
ICDE
1998
IEEE
119views Database» more  ICDE 1998»
14 years 6 months ago
Processing Incremental Multidimensional Range Queries in a Direct Manipulation Visual Query
We have developed a MultiMedia Visual Information Seeking (MMVIS) Environment that is the first system to support an integrated approach to the direct manipulation specification o...
Stacie Hibino, Elke A. Rundensteiner
MICS
2010
137views more  MICS 2010»
13 years 3 months ago
Finding Range Minima in the Middle: Approximations and Applications
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Johannes Fischer, Volker Heun