1720 search results - page 179 / 344 » Unranking Combinations in Parallel |
145
click to vote
PDCAT
2005
Springer
15 years 10 months ago
2005
Springer
In this paper security requirements and security architecture for 4G systems are presented with the consideration of Trusted Computing (TC) for mobile equipment (ME). The security...
131
click to vote
PODC
2004
ACM
15 years 9 months ago
2004
ACM
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...
136
click to vote
PODC
2004
ACM
15 years 9 months ago
2004
ACM
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
117
click to vote
PODC
2004
ACM
15 years 9 months ago
2004
ACM
Secure function evaluation (SFE) enables a group of players, by themselves, to evaluate a function on private inputs as securely as if a trusted third party had done it for them. ...
154
click to vote
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
The literature describes two high performance concurrent stack algorithms based on combining funnels and elimination trees. Unfortunately, the funnels are linearizable but blockin...