Sciweavers

3415 search results - page 644 / 683
» Lower Bounds for Kernelizations
Sort
View
FOCS
2008
IEEE
14 years 4 months ago
Near-Optimal Sparse Recovery in the L1 Norm
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
Piotr Indyk, Milan Ruzic
ICC
2008
IEEE
115views Communications» more  ICC 2008»
14 years 4 months ago
On the Performance of Linear Least-Squares Estimation in Wireless Positioning Systems
A common technique for wireless positioning is to estimate time-of-arrivals (TOAs) of signals traveling between a target node and a number of reference nodes, and then to determin...
Sinan Gezici, Ismail Güvenç, Zafer Sah...
INFOCOM
2008
IEEE
14 years 4 months ago
On the Performance of IEEE 802.11 under Jamming
—In this paper, we study the performance of the IEEE 802.11 MAC protocol under a range of jammers that covers both channel-oblivious and channel-aware jamming. We study two chann...
Emrah Bayraktaroglu, Christopher King, Xin Liu, Gu...
INFOCOM
2008
IEEE
14 years 4 months ago
Randomized 3D Geographic Routing
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...
Roland Flury, Roger Wattenhofer
FOCS
2007
IEEE
14 years 4 months ago
A Primal-Dual Randomized Algorithm for Weighted Paging
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...
Nikhil Bansal, Niv Buchbinder, Joseph Naor