3495 search results - page 178 / 699 » On the random satisfiable process |
110
click to vote
TIT
2008
15 years 4 months ago
2008
In this paper, coding theorems on the (t; m)-threshold scheme for a general source are discussed, where m means the number of the shares and t means a threshold. The (t; m)-thresho...
152
Voted
TOG
2002
15 years 4 months ago
2002
There are many applications that demand large quantities of natural looking motion. It is difficult to synthesize motion that looks natural, particularly when it is people who mus...
136
Voted
PIMRC
2010
IEEE
15 years 2 months ago
2010
IEEE
We consider the problem of multi-cell downlink beamforming with N cells and K terminals per cell. Cooperation among base stations (BSs) has been found to increase the system throug...
129
Voted
CRYPTO
2010
Springer
15 years 2 months ago
2010
Springer
We show that the widely deployed RSA-OAEP encryption scheme of Bellare and Rogaway (Eurocrypt 1994), which combines RSA with two rounds of an underlying Feistel network whose hash...
123
click to vote
RSA
2006
15 years 4 months ago
2006
Following the entropy method this paper presents general concentration inequalities, which can be applied to combinatorial optimization and empirical processes. The inequalities g...