2168 search results - page 396 / 434 » Randomized Algorithms and Complexity Theory |
111
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
A network of n wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power P or rema...
133
click to vote
SIGECOM
2008
ACM
15 years 2 months ago
2008
ACM
We study the question of how to easily recognize whether a social unction f from an abstract type space to a set of outcomes is truthful, i.e. implementable by a truthful mechanis...
143
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
—With the convergence of multimedia applications and wireless communications, there is an urgent need for developing new scheduling algorithms to support real-time traffic with ...
180
Voted
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
140
click to vote
CIKM
2011
Springer
14 years 2 months ago
2011
Springer
In this paper, we reveal a common deficiency of the current retrieval models: the component of term frequency (TF) normalization by document length is not lower-bounded properly;...