Results 1  10
of
17,862
Distance distributions
"... based on a hypothetical consensus model in which the nodes of the network try to reach as be es rep gree distributions include the selection of the best fit, and the way to compare the heterogeneity of networks with different types of distributions [4,7]. Statistical distributions of other graphthe ..."
Abstract
 Add to MetaCart
theoretic parameters have also been studied for complex networks, such as the eigenvalue distributions [8] and the node–node distance distribution [9–11]. The distancebased analogous of the node degree distribution in a network is the distancesum distribution. This kind of distribution has not previously been
Distance distributions in regular polygons
 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
, 2013
"... This paper derives the exact cumulative density function of the distance between a randomly located node and any arbitrary reference point inside a regular Lsided polygon. Using this result, we obtain the closedform probability density function (PDF) of the Euclidean distance between any arbitrary ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
arbitrary reference point and its nth neighbour node, when N nodes are uniformly and independently distributed inside a regular Lsided polygon. First, we exploit the rotational symmetry of the regular polygons and quantify the effect of polygon sides and vertices on the distance distributions. Then we
Distance Vector Multicast Routing Protocol
 RFC 1075, BBN
, 1988
"... This RFC describes a distancevectorstyle routing protocol for routing multicast datagrams through an internet. It is derived from the Routing Information Protocol (RIP) [1], and implements multicasting as described in RFC1054. This is an experimental protocol, and its implementation is not recomm ..."
Abstract

Cited by 475 (3 self)
 Add to MetaCart
This RFC describes a distancevectorstyle routing protocol for routing multicast datagrams through an internet. It is derived from the Routing Information Protocol (RIP) [1], and implements multicasting as described in RFC1054. This is an experimental protocol, and its implementation
On the distance distribution of codes
 IEEE Trans. Inform. Theory
, 1995
"... Abstract The dimme drctrrbutron of a binary code C ' is the sequence ..."
Abstract

Cited by 31 (1 self)
 Add to MetaCart
Abstract The dimme drctrrbutron of a binary code C ' is the sequence
Estimates of the distance distribution of codes and designs
 IEEE Trans. Inform. Theory
"... Abstract—We consider the problem of bounding the distance distribution for unrestricted block codes with known distance and/or dual distance. Applying the polynomial method, we provide a general framework for previously known results. We derive several upper and lower bounds both for finite length a ..."
Abstract

Cited by 19 (7 self)
 Add to MetaCart
Abstract—We consider the problem of bounding the distance distribution for unrestricted block codes with known distance and/or dual distance. Applying the polynomial method, we provide a general framework for previously known results. We derive several upper and lower bounds both for finite length
Iterative point matching for registration of freeform curves and surfaces
, 1994
"... A heuristic method has been developed for registering two sets of 3D curves obtained by using an edgebased stereo system, or two dense 3D maps obtained by using a correlationbased stereo system. Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in ma ..."
Abstract

Cited by 660 (8 self)
 Add to MetaCart
in one set to the closest points in the other. A statistical method based on the distance distribution is used to deal with outliers, occlusion, appearance and disappearance, which allows us to do subsetsubset matching. A leastsquares technique is used to estimate 3D motion from the point
ENERGY MODEL WITH DISTANCE DISTRIBUTION
, 2009
"... Data traffic in sensor networks follows manytoone pattern, ussally the area close to the sink is always crowded if uniform grid is used [1]. Opportunistic griding is therefore advantageous in smoothing energy distribution. Grids close to the sink, which have heavier traffic load, will have a small ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
smaller size compared with those are farther away, such that a shorter transmission range is used. Sensors that are far away have less traffic, but have to transmit over longer distance. This method will intuitively balance out the uneven traffic distribution due to geometric location, and thus make
Bounds on Distance Distribution of Codes
"... Let F n be the set of all 0 − 1 vectors of length n. The Hamming distance, d(u, v) of two vectors u, v in F n is the number of positions they differ. A binary code C of length ..."
Abstract
 Add to MetaCart
Let F n be the set of all 0 − 1 vectors of length n. The Hamming distance, d(u, v) of two vectors u, v in F n is the number of positions they differ. A binary code C of length
More on the distance distribution of BCH codes
 IEEE Trans. Inform. Theory
, 1999
"... We derive a new estimate for the error term in the binomial approximation to the distance distribution of BCH codes. This is an improvement on the earlier bounds by KasamiFujiwaraLin, VladutsSkorobogatov, and KrasikovLitsyn. Keywords: BCH codes, distance distribution 1 Introduction Consider the ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We derive a new estimate for the error term in the binomial approximation to the distance distribution of BCH codes. This is an improvement on the earlier bounds by KasamiFujiwaraLin, VladutsSkorobogatov, and KrasikovLitsyn. Keywords: BCH codes, distance distribution 1 Introduction Consider
Exact Sampling with Coupled Markov Chains and Applications to Statistical Mechanics
, 1996
"... For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain has ..."
Abstract

Cited by 543 (13 self)
 Add to MetaCart
For many applications it is useful to sample from a finite set of objects in accordance with some particular distribution. One approach is to run an ergodic (i.e., irreducible aperiodic) Markov chain whose stationary distribution is the desired distribution on this set; after the Markov chain
Results 1  10
of
17,862