Sciweavers

1243 search results - page 9 / 249
» On the locality of bounded growth
Sort
View
PODC
2009
ACM
14 years 8 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
CISS
2008
IEEE
14 years 2 months ago
Cramer Rao bound on target localization estimation in MIMO radar systems
Abstract— This paper presents an analysis of target localization accuracy, attainable by the use of MIMO (MultipleInput Multiple-Output) radar systems, configured with multiple ...
Hana Godrich, Alexander M. Haimovich, Rick S. Blum
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
13 years 9 months ago
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
Hang Dinh, Alexander Russell
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
14 years 7 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson