Sciweavers

17 search results - page 4 / 4
» Closest Substring Problems with Small Distances
Sort
View
FOCS
2004
IEEE
13 years 9 months ago
Worst-Case to Average-Case Reductions Based on Gaussian Measures
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...
Daniele Micciancio, Oded Regev
IEEECSA
2009
13 years 3 months ago
Multiratecast in Wireless Fault Tolerant Sensor and Actuator Networks
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...
Xuehong Liu, Arnaud Casteigts, Nishith Goel, Amiya...