85 search results - page 8 / 17 » On Minimum Circular Arrangement |
COMPGEOM
2000
ACM
14 years 2 days ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
3DIM
2001
IEEE
13 years 11 months ago
2001
IEEE
Laser range scanners are a popular method for acquiring three-dimensional geometry due to their accuracy and robustness. Maximizing scanner accuracy while minimizing engineering c...
PIMRC
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— In a slot-synchronized wireless communication system, a set of signature sequences can be derived by circularly shifting a base sequence with good auto correlation prop...
MICAI
2005
Springer
14 years 1 months ago
2005
Springer
In this paper the Minimum Linear Arrangement (MinLA) problem is studied within the framework of memetic algorithms (MA). A new dedicated recombination operator called Trajectory Cr...
TSP
2010
13 years 2 months ago
2010
Abstract--This paper addresses pilot-assisted channel estimation for wireless orthogonal frequency division multiplexing (OFDM) systems with irregular pilot arrangements. Using non...