3608 search results - page 128 / 722 » computer 2011 |
108
Voted
DATAMINE
2011
14 years 7 months ago
2011
162
Voted
MST
2011
14 years 10 months ago
2011
This paper is concerned with the complexity of computing winning strategies for poset games. While it is reasonably clear that such strategies can be computed in PSPACE, we give a ...
167
Voted
APAL
2011
14 years 10 months ago
2011
We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper Σ0 4 ideal in the c.e. Turing degrees has an incomplete upper bound. It follows t...
117
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
The fundamental problem of our interest is soft MIMO detection for the case of block fading, i.e., when the transmitted codeword spans over several independent channel realization...
197
click to vote
FGIT
2011
Springer
14 years 3 months ago
2011
Springer
This paper describes the result of performance evaluation of two kinds of MapReduce applications running in the FutureGrid: a data intensive application and a computation intensive...