157 search results - page 18 / 32 » Randomized Algorithms for Minimum Distance Localization |
TIT
2008
13 years 7 months ago
2008
The minimum distance is one of the most important combinatorial characterizations of a code. The maximum likelihood decoding problem is one of the most important algorithmic proble...
VTC
2010
IEEE
13 years 6 months ago
2010
IEEE
—A common simplification in the treatment of random linear channels is the assumption of stationarity of the channel in time. The wireless channel is, however, known to be inher...
SENSYS
2003
ACM
14 years 1 months ago
2003
ACM
Many sensor network applications require that each node’s sensor stream be annotated with its physical location in some common coordinate system. Manual measurement and configu...
CIAC
2000
Springer
14 years 7 days ago
2000
Springer
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...