17 search results - page 4 / 4 » Closest Substring Problems with Small Distances |
116
Voted
FOCS
2004
IEEE
15 years 4 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
161
Voted
IEEECSA
2009
14 years 10 months ago
2009
We study the multicast problem in wireless sensor networks, where the source can send data to a fixed number of destinations (actuators) at a different rate (multiratecast). A typi...