Sciweavers

3415 search results - page 642 / 683
» Lower Bounds for Kernelizations
Sort
View
IROS
2009
IEEE
129views Robotics» more  IROS 2009»
14 years 4 months ago
Predicting the navigation performance of underwater vehicles
— In this paper we present a general framework for predicting the positioning uncertainty of underwater vehicles. We apply this framework to common examples from marine robotics:...
Brian Bingham
ALGOSENSORS
2009
Springer
14 years 4 months ago
A Note on Uniform Power Connectivity in the SINR Model
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
Chen Avin, Zvi Lotker, Francesco Pasquale, Yvonne ...
ALGOSENSORS
2009
Springer
14 years 4 months ago
Near-Optimal Radio Use for Wireless Network Synchronization
In this paper we consider the model of communication where wireless devices can either switch their radios off to save energy (and hence, can neither send nor receive messages), o...
Milan Bradonjic, Eddie Kohler, Rafail Ostrovsky
APPROX
2009
Springer
85views Algorithms» more  APPROX 2009»
14 years 4 months ago
Pseudorandom Generators and Typically-Correct Derandomization
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...
Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel
APPROX
2009
Springer
112views Algorithms» more  APPROX 2009»
14 years 4 months ago
Deterministic Approximation Algorithms for the Nearest Codeword Problem
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
Noga Alon, Rina Panigrahy, Sergey Yekhanin