21520 search results - page 19 / 4304 » Symmetric network computation |
145
click to vote
IJAC
2006
15 years 6 months ago
2006
By the fundamental theorem of symmetric polynomials, if P Q[X1, . . . , Xn] is symmetric, then it can be written P = Q(1, . . . , n), where 1, . . . , n are the elementary symmet...
191
click to vote
ESAS
2004
Springer
15 years 12 months ago
2004
Springer
The common perception of public key cryptography is that it is complex, slow and power hungry, and as such not at all suitable for use in ultra-low power environments like wireless...
193
click to vote
ICPP
1993
IEEE
15 years 10 months ago
1993
IEEE
Optimal load allocation for load sharing a divisible job over processors interconnected in either a bus or a tree network is considered. The processors are either equipped with fro...
156
click to vote
ECUMN
2007
Springer
15 years 10 months ago
2007
Springer
In UMTS mobile networks, there are some circumstances that the International Mobile Subscriber Identity (IMSI) of a user is conveyed in clear-text over the radio interface. Such s...
191
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—We consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical problem in distri...