An Efficient Algorithm to Compute the Euclidean Distance Spectrum of a General Intersymbol Interference Channel and Its Applications

Given a set of positive-weighted points and a query rectangler(specified by a client) of given extents, the goal of a maximizing range sum (MaxRS) query is to find the optimal location ofrsuch that the total weights of all the points covered byrare maximized. All existing methods for processing MaxRS queries assume the Euclidean distance metric. In many location-based applications, however, the motion of a client may be constrained by an underlying (spatial) road network; that is, the client cannot move freely in space. This paper addresses the problem of processing MaxRS queries in a road network. We propose the external-memory algorithm that is suited for a large road network database. In addition, in contrast to the existing methods, which retrieve only one optimal location, our proposed algorithm retrieves all the possible optimal locations. Through simulations, we evaluate the performance of the proposed algorithm.

Download Full-text

PAM codes for optical scan intersymbol interference channel

GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record ◽

10.1109/glocom.1997.632567 ◽

2002 ◽

Author(s):

C.-K. Park ◽

L.R. Welch

Keyword(s):

Intersymbol Interference ◽

Interference Channel ◽

Optical Scan

Download Full-text

An efficient algorithm for complete Euclidean distance transform on mesh-connected SIMD

Parallel Computing ◽

10.1016/0167-8191(94)00103-h ◽

1995 ◽

Vol 21 (5) ◽

pp. 841-852 ◽

Cited By ~ 22

Author(s):

Ling Chen ◽

Henry Y.H. Chuang

Keyword(s):

Efficient Algorithm ◽

Euclidean Distance ◽

Distance Transform ◽

Euclidean Distance Transform

Download Full-text

A GEOMETRIC SPANNER OF SEGMENTS

International Journal of Computational Geometry & Applications ◽

10.1142/s0218195910003190 ◽

2010 ◽

Vol 20 (01) ◽

pp. 43-67

Author(s):

JINHUI XU ◽

YANG YANG ◽

YONGDING ZHU ◽

NAOKI KATOH

Keyword(s):

Computational Geometry ◽

Efficient Algorithm ◽

Euclidean Distance ◽

Dominating Set ◽

Optimal Solution ◽

Minimum Size ◽

Steiner Points ◽

Separation Ratio ◽

Geometric Spanner ◽

Relative Separation

Geometric spanner is a fundamental structure in computational geometry and plays an important role in many geometric networks design applications. In this paper, we consider a generalization of the classical geometric spanner problem (called segment spanner): Given a set S of n disjoint 2-D segments, find a spanning network GS with minimum size so that for any pair of points in S, there exists a path in GS with length no more than t times their Euclidean distance. Based on a number of interesting techniques (such as weakly dominating set, strongly dominating set, interval cover, and imaginary Steiner points), we present an efficient algorithm to construct the segment spanner. Our approach first identifies a set Q of Steiner points in S and then constructs a point spanner for the set of Steiner points. Our algorithm runs in O(|Q| + n2 log n) time and Q is a constant approximation (in terms of its size) of the optimal solution when S has a constant relative separation ratio. The approximation ratio depends on the stretch factor t and the relative separation ratio of S.

Download Full-text