2168 search results - page 253 / 434 » Randomized Algorithms and Complexity Theory |
147
click to vote
STOC
2005
ACM
16 years 3 months ago
2005
ACM
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
135
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...
123
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
The concept of distributed transmit beamforming is implicit in many key results of network information theory. However, its implementation in a wireless network involves the funda...
172
click to vote
LOGCOM
2010
14 years 10 months ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
181
click to vote
GECCO
2011
Springer
14 years 7 months ago
2011
Springer
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...