Results 1  10
of
627
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
for these constraints yields estimates for the unknown positions of the nodes in the network. Providing that the constraints are tight enough, simulation illustrates that this estimate becomes close to the actual node positions. Additionally, a method for placing rectangular bounds around the possible positions for all
The benefits of coding over routing in a randomized setting
 In Proceedings of 2003 IEEE International Symposium on Information Theory
, 2003
"... Abstract — We present a novel randomized coding approach for robust, distributed transmission and compression of information in networks. We give a lower bound on the success probability of a random network code, based on the form of transfer matrix determinant polynomials, that is tighter than the ..."
Abstract

Cited by 361 (44 self)
 Add to MetaCart
exponentially with the number of codeword bits. We demonstrate the advantage of randomized coding over routing for distributed transmission in rectangular grid networks by giving, in terms of the relative grid locations of a sourcereceiver pair, an upper bound on routing success probability that is exceeded
Measuring rectangularity
 Machine Vision and Applications, 11:191
, 1999
"... Three new methods for measuring the rectangularity of regions are developed. They are tested together with the standard minimum bounding rectangle method on synthetic and real data. It is concluded that while all the methods have their drawbacks the best two are the bounding rectangle and discrepanc ..."
Abstract

Cited by 17 (8 self)
 Add to MetaCart
Three new methods for measuring the rectangularity of regions are developed. They are tested together with the standard minimum bounding rectangle method on synthetic and real data. It is concluded that while all the methods have their drawbacks the best two are the bounding rectangle
Rectangular Hybrid Games
 In CONCUR 99, LNCS 1664
, 1999
"... In order to study control problems for hybrid systems, we generalize hybrid automata to hybrid games  say, controller vs. plant. If we specify the continuous dynamics by constant lower and upper bounds, we obtain rectangular games. We show that for rectangular games with objectives expressed in Lt ..."
Abstract

Cited by 40 (4 self)
 Add to MetaCart
In order to study control problems for hybrid systems, we generalize hybrid automata to hybrid games  say, controller vs. plant. If we specify the continuous dynamics by constant lower and upper bounds, we obtain rectangular games. We show that for rectangular games with objectives expressed
THE RECTANGULAR SURVEY VERSUS METES AND BOUNDS: SYSTEMATIC AND UNSYSTEMATIC
"... Abstract. We examine the economic effects of an important institutional innovation, the systematic demarcation of property boundaries relative to indiscriminate land claiming and bounding. The former results in a uniform grid of rectangular surveys (RS), whereas the latter results in haphazard local ..."
Abstract
 Add to MetaCart
Abstract. We examine the economic effects of an important institutional innovation, the systematic demarcation of property boundaries relative to indiscriminate land claiming and bounding. The former results in a uniform grid of rectangular surveys (RS), whereas the latter results in haphazard
Upper Bounds for ZGrid Rectangular Covering Problems
, 2001
"... A problem of combinatorial geometry is discussed: Cover a finite set of points lying on an integer grid in the Euclidean plane by regular rectangles such that the total area, circumference and number of rectangles used is minimized. This problem should be NPhard, which is surely the case for relate ..."
Abstract
 Add to MetaCart
for related problems concerning covering points arbitrarily distributed in the plane. For any reasonable value k being the minimal allowed side length for rectangles, we propose an exact deterministic algorithm based on set theoretic dynamic programming, which then is improved by exploiting the rectangular
Fast Distance Queries with Rectangular Swept Sphere Volumes
 Proc. of IEEE Int. Conference on Robotics and Automation
, 2000
"... : We present new distance computation algorithms using hierarchies of rectangular swept spheres. Each bounding volume of the tree is described as the Minkowski sum of a rectangle and a sphere, and fits tightly to the underlying geometry. We present accurate and efficient algorithms to build the hier ..."
Abstract

Cited by 65 (14 self)
 Add to MetaCart
: We present new distance computation algorithms using hierarchies of rectangular swept spheres. Each bounding volume of the tree is described as the Minkowski sum of a rectangle and a sphere, and fits tightly to the underlying geometry. We present accurate and efficient algorithms to build
RECTANGULAR RTRANSFORM AT THE LIMIT OF RECTANGULAR SPHERICAL INTEGRALS
, 909
"... Abstract. In this paper, we connect rectangular free probability theory and spherical integrals. In this way, we prove the analogue, for rectangular or square non symmetric real matrices, of a result that Guionnet and Maïda proved for symmetric matrices in [GM05]. More specifically, we study the lim ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. In this paper, we connect rectangular free probability theory and spherical integrals. In this way, we prove the analogue, for rectangular or square non symmetric real matrices, of a result that Guionnet and Maïda proved for symmetric matrices in [GM05]. More specifically, we study
RAPID MULTIPLICATION OF RECTANGULAR MATRICES*
"... Abstract. The number of essential multiplications required to multiply matrices of size N N and N N '172 is bounded by CN 2 log N. ..."
Abstract
 Add to MetaCart
Abstract. The number of essential multiplications required to multiply matrices of size N N and N N '172 is bounded by CN 2 log N.
The Theory of Rectangular Hybrid Automata
, 1996
"... A hybrid automaton consists of a finite automaton interacting with a dynamical system. Hybrid automata are used to model embedded controllers and other systems that consist of interacting discrete and continuous components. Ahybrid automaton is rectangular if each of its continuous variables x satis ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
satisfies a nondeterministic di erential equation of the form a dx dt b, where a and b are rational constants. Rectangular hybrid automata are particularly useful for the analysis of communication protocols in which local clocks have bounded drift, and for the conservative approximation of systems with more
Results 1  10
of
627