157 search results - page 8 / 32 » Randomized Algorithms for Minimum Distance Localization |
INFOCOM
2007
IEEE
15 years 3 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
TCS
2010
14 years 8 months ago
2010
Cops and Robbers is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robbers, distance k Cops and Robbers, where t...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
It is shown that the error control problem in random network coding can be reformulated as a generalized decoding problem for rank-metric codes. This result allows many of the too...
105
click to vote
CISS
2007
IEEE
15 years 1 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
IDA
1999
Springer
15 years 1 months ago
1999
Springer
A method for the linear discrimination of two classes has been proposed by us in 3 . It searches for the discriminant direction which maximizes the distance between the projected c...