2576 search results - page 24 / 516 » The Complexity of Zero Knowledge |
110
click to vote
ISCC
2008
IEEE
15 years 8 months ago
2008
IEEE
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
EMNLP
2010
14 years 11 months ago
2010
This paper proposes a unified framework for zero anaphora resolution, which can be divided into three sub-tasks: zero anaphor detection, anaphoricity determination and antecedent ...
113
click to vote
JC
2007
15 years 1 months ago
2007
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
TIT
2008
15 years 1 months ago
2008
Orthogonal-frequency-divisionmultiplexing(OFDM) transforms a frequency-selective multiple-input multiple-output (MIMO) fading channel into a MIMO-OFDM channel that has a well-defin...
114
click to vote
EMNLP
2009
14 years 11 months ago
2009
This paper proposes a probabilistic model for associative anaphora resolution in Japanese. Associative anaphora is a type of bridging anaphora, in which the anaphor and its antece...