Sciweavers

49 search results - page 5 / 10
» Two-Dimensional Range Minimum Queries
Sort
View
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Untangled Monotonic Chains and Adaptive Range Search
Abstract. We present the first adaptive data structure for two-dimensional orthogonal range search. Our data structure is adaptive in the sense that it gives improved search perfo...
Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, ...
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
14 years 2 months ago
Online Sorted Range Reporting
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 7 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...
ADHOC
2005
100views more  ADHOC 2005»
13 years 7 months ago
Robust position-based routing for wireless ad hoc networks
We consider a wireless ad hoc network composed of a set of wireless nodes distributed in a two dimensional plane. Several routing protocols based on the positions of the mobile ho...
Kousha Moaveninejad, Wen-Zhan Song, Xiang-Yang Li
WADS
2009
Springer
268views Algorithms» more  WADS 2009»
14 years 2 months ago
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
Prosenjit Bose, Meng He, Anil Maheshwari, Pat Mori...