727 search results - page 19 / 146 » One line and n points |
CORR
2008
Springer
15 years 15 days ago
2008
Springer
This work considers the problem of quickest detection with N distributed sensors that receive sequential observations either in discrete or in continuous time from the environment....
IPPS
1997
IEEE
15 years 4 months ago
1997
IEEE
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
71
Voted
TIT
2008
15 years 9 days ago
2008
One-to-one codes are "one shot" codes that assign a distinct codeword to source symbols and are not necessarily prefix codes (more generally, uniquely decodable). For ex...
57
Voted
DM
2008
15 years 14 days ago
2008
Rahilly [10] described a construction that relates any Hadamard design H on 4m -1 points with a line spread to an affine design having the same parameters as the classical design ...
97
Voted
ISAAC
2009
Springer
15 years 7 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...