15033 search results - page 389 / 3007 » Complexity Theory and Algorithms |
215
click to vote
GLOBECOM
2007
IEEE
16 years 1 months ago
2007
IEEE
—In this paper, we present an iterative algorithm for channel complex gains estimation with inter-sub-carrierinterference (ICI) reduction in orthogonal-frequency-divisionmultiple...
169
Voted
COCOON
2007
Springer
16 years 1 months ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
225
click to vote
COCO
2001
Springer
15 years 12 months ago
2001
Springer
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
186
click to vote
STOC
1991
ACM
15 years 11 months ago
1991
ACM
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
221
click to vote
ISAAC
2010
Springer
15 years 5 months ago
2010
Springer
We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such pr...