Sciweavers

658 search results - page 23 / 132
» Lower bounds for sorting networks
Sort
View
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 8 months ago
Searching dynamic point sets in spaces with bounded doubling dimension
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
Richard Cole, Lee-Ad Gottlieb
GLOBECOM
2008
IEEE
14 years 2 months ago
Prioritized Maximal Scheduling in Wireless Networks
— This paper considers the scheduling problem in wireless networks. We focus on prioritized maximal scheduling, where a maximal scheduler chooses the links in an order specified...
Qiao Li, Rohit Negi
GLOBECOM
2010
IEEE
13 years 5 months ago
Design of Amplify and Forward MIMO Relay Networks with QoS Constraint
In this paper, we design the optimal precoding matrices for amplify-and-forward (AF) multiple-input multipleoutput (MIMO) relay networks. Specifically, we consider a dualhop relay ...
Jafar Mohammadi, Feifei Gao, Yue Rong
WDAG
2009
Springer
166views Algorithms» more  WDAG 2009»
14 years 2 months ago
New Bounds for the Controller Problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
Yuval Emek, Amos Korman
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
13 years 9 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos