Sciweavers

5329 search results - page 79 / 1066
» The Weighted Majority Algorithm
Sort
View
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
14 years 9 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
JMLR
2012
11 years 11 months ago
Graphlet decomposition of a weighted network
We introduce the graphlet decomposition of a weighted network, which encodes a notion of social information based on social structure. We develop a scalable algorithm, which combi...
Hossein Azari Soufiani, Edo Airoldi
ICC
2008
IEEE
112views Communications» more  ICC 2008»
14 years 3 months ago
Weighted Fair Uplink/Downlink Access Provisioning in IEEE 802.11e WLANs
— We present the unfairness problem between the uplink and the downlink flows in the IEEE 802.11e infrastructure Basic Service Set (BSS) when the default settings of the Enhance...
Feyza Keceli, Inanc Inan, Ender Ayanoglu
GLOBECOM
2007
IEEE
13 years 10 months ago
Optimal Downlink OFDMA Subcarrier, Rate, and Power Allocation with Linear Complexity to Maximize Ergodic Weighted-Sum Rates
Abstract— In this paper, we propose a resource allocation algorithm for ergodic weighted-sum rate maximization in downlink OFDMA systems. In contrast to most previous research tha...
Ian C. Wong, Brian L. Evans
MOC
2002
86views more  MOC 2002»
13 years 8 months ago
On the step-by-step construction of quasi--Monte Carlo integration rules that achieve strong tractability error bounds in weight
We develop and justify an algorithm for the construction of quasi
Ian H. Sloan, Frances Y. Kuo, Stephen Joe