Results 1  10
of
8,564
An Optimal Algorithm for Approximating a Set of Rectangles by Two Minimum Area Rectangles
, 1991
"... In this paper we face the problem of computing a conservative approximation of a set of isothetic rectangles in the plane by means of a pair of enclosing isothetic rectangles. We propose an O(n log n) time algorithm for finding, given a set M of n isothetic rectangles, a pair of isothetic rectangles ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
rectangles (s; t) such that s and t enclose all rectangles of M and area(s) + area(t) is minimal. Moreover we prove an O(n log n) lower bound for the onedimensional version of the problem. 1 Introduction Computing approximated, concise representations of complex shapes is a standard problem in computer
The R*tree: an efficient and robust access method for points and rectangles
 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA
, 1990
"... The Rtree, one of the most popular access methods for rectangles, is based on the heuristic optimization of the area of the enclosing rectangle in each inner node. By running numerous experiments in a standardized testbed under highly varying data, queries and operations, we were able to design the ..."
Abstract

Cited by 1262 (74 self)
 Add to MetaCart
The Rtree, one of the most popular access methods for rectangles, is based on the heuristic optimization of the area of the enclosing rectangle in each inner node. By running numerous experiments in a standardized testbed under highly varying data, queries and operations, we were able to design
Minimum energy mobile wireless networks
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 1999
"... We describe a distributed positionbased network protocol optimized for minimum energy consumption in mobile wireless networks that support peertopeer communications. Given any number of randomly deployed nodes over an area, we illustrate that a simple local optimization scheme executed at each n ..."
Abstract

Cited by 749 (0 self)
 Add to MetaCart
We describe a distributed positionbased network protocol optimized for minimum energy consumption in mobile wireless networks that support peertopeer communications. Given any number of randomly deployed nodes over an area, we illustrate that a simple local optimization scheme executed at each
VERY HIGH RESOLUTION INTERPOLATED CLIMATE SURFACES FOR GLOBAL LAND AREAS
, 2005
"... We developed interpolated climate surfaces for global land areas (excluding Antarctica) at a spatial resolution of 30 arc s (often referred to as 1km spatial resolution). The climate elements considered were monthly precipitation and mean, minimum, and maximum temperature. Input data were gathered ..."
Abstract

Cited by 553 (8 self)
 Add to MetaCart
We developed interpolated climate surfaces for global land areas (excluding Antarctica) at a spatial resolution of 30 arc s (often referred to as 1km spatial resolution). The climate elements considered were monthly precipitation and mean, minimum, and maximum temperature. Input data were gathered
Fast subsequence matching in timeseries databases
 PROCEEDINGS OF THE 1994 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA
, 1994
"... We present an efficient indexing method to locate 1dimensional subsequences within a collection of sequences, such that the subsequences match a given (query) pattern within a specified tolerance. The idea is to map each data sequence into a small set of multidimensional rectangles in feature space ..."
Abstract

Cited by 533 (24 self)
 Add to MetaCart
such trails into subtrails, which are subsequently represented by their Minimum Bounding Rectangles (MBRs). We also examine queries of varying lengths, and we show how to handle each case efficiently. We implemented our method and carried out experiments on synthetic and real data (stock price movements). We
Tree visualization with Treemaps: A 2d spacefilling approach
 ACM Transactions on Graphics
, 1991
"... this paper deals with a twodimensional (2d) spacefilling approach in which each node is a rectangle whose area is proportional to some attribute such as node size. Research on relationships between 2d images and their representation in tree structures has focussed on node and link representation ..."
Abstract

Cited by 534 (29 self)
 Add to MetaCart
this paper deals with a twodimensional (2d) spacefilling approach in which each node is a rectangle whose area is proportional to some attribute such as node size. Research on relationships between 2d images and their representation in tree structures has focussed on node and link
Convex Position Estimation in Wireless Sensor Networks
"... A method for estimating unknown node positions in a sensor network based exclusively on connectivityinduced constraints is described. Known peertopeer communication in the network is modeled as a set of geometric constraints on the node positions. The global solution of a feasibility problem fo ..."
Abstract

Cited by 493 (0 self)
 Add to MetaCart
unknown nodes in the network is given. The area of the bounding rectangles decreases as additional or tighter constraints are included in the problem. Specific models are suggested and simulated for isotropic and directional communication, representative of broadcastbased and optical transmission
Critical Power for Asymptotic Connectivity in Wireless Networks
, 1998
"... : In wireless data networks each transmitter's power needs to be high enough to reach the intended receivers, while generating minimum interference on other receivers sharing the same channel. In particular, if the nodes in the network are assumed to cooperate in routing each others ' pack ..."
Abstract

Cited by 541 (19 self)
 Add to MetaCart
: In wireless data networks each transmitter's power needs to be high enough to reach the intended receivers, while generating minimum interference on other receivers sharing the same channel. In particular, if the nodes in the network are assumed to cooperate in routing each others &apos
On the Minimum Node Degree and Connectivity of a Wireless Multihop Network
 ACM MobiHoc
, 2002
"... This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k–connectivity. Both topology attributes depend on the spatial distribution of the nodes and their transmission range. Using typical modeling assumptions — a random uniform distri ..."
Abstract

Cited by 318 (4 self)
 Add to MetaCart
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k–connectivity. Both topology attributes depend on the spatial distribution of the nodes and their transmission range. Using typical modeling assumptions — a random uniform
Valid conjunction inference with the minimum statistic. NeuroImage 25, 653–660
, 2005
"... In logic a conjunction is defined as an AND between truth statements. In neuroimaging, investigators may look for brain areas activated by task A AND by task B, or a conjunction of tasks (Price & Friston, 1997). Friston et al. (1999b) introduced a minimum statistic test for conjunction. We refer ..."
Abstract

Cited by 256 (4 self)
 Add to MetaCart
In logic a conjunction is defined as an AND between truth statements. In neuroimaging, investigators may look for brain areas activated by task A AND by task B, or a conjunction of tasks (Price & Friston, 1997). Friston et al. (1999b) introduced a minimum statistic test for conjunction. We
Results 1  10
of
8,564