4526 search results - page 261 / 906 » Algorithmic problems related to the Internet |
191
click to vote
FOCS
2006
IEEE
16 years 20 days ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
167
click to vote
GLOBECOM
2006
IEEE
16 years 20 days ago
2006
IEEE
— This paper develops a hierarchical iterative OSNR algorithm based on a game theory framework. A Nash game is formulated between channels with channel utility related to maximiz...
177
click to vote
WINET
2010
15 years 5 months ago
2010
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
185
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Due to multipath delay spread and relatively high sampling rate in OFDM systems, the channel estimation is formulated as a sparse recovery problem, where a hybrid compressed sensi...
194
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Recently, the maximum likelihood estimator (MLE) and Cramer-Rao Lower Bound (CRLB) were proposed with the goal of maximizing and assessing the synchronization accuracy in wireless...