Sciweavers

855 search results - page 42 / 171
» Complexity of Equations over Sets of Natural Numbers
Sort
View
VTC
2007
IEEE
15 years 4 months ago
Adaptive Conjugate Gradient DFEs for Wideband MIMO Systems Using Galerkin Projections
— Three new adaptive equalization algorithms for wireless systems operating over frequency selective MIMO channels are proposed. The problem of the MIMO DFE design is formulated ...
Vassilis Kekatos, Aris S. Lalos, Kostas Berberidis
INFOCOM
2009
IEEE
15 years 4 months ago
On Fast Optimal STDMA Scheduling over Fading Wireless Channels
—Most prior studies on wireless spatial-reuse TDMA (STDMA) link scheduling for throughput optimization deal with the situation where instantaneous channel state information (CSI)...
JiaLiang Zhang, Soung Chang Liew, Liqun Fu
CIKM
2006
Springer
15 years 1 months ago
Evaluation by comparing result sets in context
Familiar evaluation methodologies for information retrieval (IR) are not well suited to the task of comparing systems in many real settings. These systems and evaluation methods m...
Paul Thomas, David Hawking
ICML
2010
IEEE
14 years 10 months ago
Continuous-Time Belief Propagation
Many temporal processes can be naturally modeled as a stochastic system that evolves continuously over time. The representation language of continuous-time Bayesian networks allow...
Tal El-Hay, Ido Cohn, Nir Friedman, Raz Kupferman
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
15 years 2 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain