85 search results - page 8 / 17 » On Minimum Circular Arrangement |
153
click to vote
COMPGEOM
2000
ACM
15 years 8 months 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...
121
click to vote
3DIM
2001
IEEE
15 years 8 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...
121
click to vote
PIMRC
2008
IEEE
15 years 10 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...
126
click to vote
MICAI
2005
Springer
15 years 9 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...
130
click to vote
TSP
2010
14 years 11 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...