4539 search results - page 388 / 908 » Approaches to Compute Workflow Complexity |
186
click to vote
TMC
2011
15 years 1 months ago
2011
— This paper establishes the equivalence between cognitive medium access and the competitive multi-armed bandit problem. First, the scenario in which a single cognitive user wish...
183
click to vote
TIT
2010
15 years 1 months ago
2010
The work identifies the first general, explicit, and non-random MIMO encoder-decoder structures that guarantee optimality with respect to the diversity-multiplexing tradeoff (DMT),...
211
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Relays represent a promising approach to extend the cell coverage, combat the strong shadowing effects as well as guarantee the QoS in dense networks. Among the numerous existing ...
188
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
201
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...