10988 search results - page 233 / 2198 » Algorithmic Folding Complexity |
122
click to vote
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
137
click to vote
JC
1998
15 years 3 months ago
1998
The problem of global solution of Fredholm integral equations is studied. This means that one seeks to approximate the full solution function (as opposed to the local problem, whe...
161
click to vote
TC
2011
14 years 10 months ago
2011
— Processing the gathered information efficiently is a key functionality for wireless sensor networks. In this article, we study the time complexity, message complexity (number ...
146
click to vote
COCO
2004
Springer
15 years 9 months ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
134
click to vote
COCO
2003
Springer
15 years 9 months ago
2003
Springer
We review and slightly strengthen known results on the Kolmogorov complexity of prefixes of effectively random sequences. First, there are recursively random random sequences su...