Sciweavers

641 search results - page 28 / 129
» Improved Bounds for Wireless Localization
Sort
View
WDAG
2010
Springer
183views Algorithms» more  WDAG 2010»
13 years 6 months ago
What Is the Use of Collision Detection (in Wireless Networks)?
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
Johannes Schneider, Roger Wattenhofer
LOCA
2009
Springer
14 years 2 months ago
Improving Location Fingerprinting through Motion Detection and Asynchronous Interval Labeling
Abstract. Wireless signal strength fingerprinting has become an increasingly popular technique for realizing indoor localization systems using existing WiFi infrastructures. Howev...
Philipp Bolliger, Kurt Partridge, Maurice Chu, Mar...
ALGORITHMICA
2010
92views more  ALGORITHMICA 2010»
13 years 7 months ago
Quantum Separation of Local Search and Fixed Point Computation
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
Xi Chen, Xiaoming Sun, Shang-Hua Teng
IWPEC
2009
Springer
14 years 2 months ago
Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
Peter Damaschke
AHSWN
2010
102views more  AHSWN 2010»
13 years 7 months ago
A Framework for the Capacity Evaluation of Multihop Wireless Networks?
The specific challenges of multihop wireles networks lead to a strong research effort on efficient protocols design where the offered capacity is a key objective. More specifically...
Hervé Rivano, Fabrice Theoleyre, Fabrice Va...