Sciweavers

1368 search results - page 228 / 274
» Generalized Rook Polynomials
Sort
View
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
16 years 17 days ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman
INFOCOM
2008
IEEE
16 years 12 days ago
Feasible Rate Allocation in Wireless Networks
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
SMA
2005
ACM
131views Solid Modeling» more  SMA 2005»
15 years 11 months ago
Manifold splines
Constructing splines whose parametric domain is an arbitrary manifold and effectively computing such splines in realworld applications are of fundamental importance in solid and ...
Xianfeng Gu, Ying He 0001, Hong Qin
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
15 years 11 months ago
On the Minimum Load Coloring Problem
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...
COLT
2004
Springer
15 years 11 months ago
Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
H. Brendan McMahan, Avrim Blum