Sciweavers

SODA
2010
ACM
181views Algorithms» more  SODA 2010»
13 years 3 months ago
Near-Optimal Sublinear Time Algorithms for Ulam Distance
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
Alexandr Andoni, Huy L. Nguyen
INFOCOM
2010
IEEE
13 years 3 months ago
Routing for Energy Minimization in the Speed Scaling Model
Abstract—We study network optimization that considers energy minimization as an objective. Studies have shown that mechanisms such as speed scaling can significantly reduce the ...
Matthew Andrews, Antonio Fernández, Lisa Zh...