27354 search results - page 5176 / 5471 » Distributed And Parallel Computing |
230
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
157
click to vote
IWCMC
2010
ACM
15 years 10 months ago
2010
ACM
Cooperative forwarding has been considered as an effective strategy for improving the geographic routing performance in wireless sensor networks (WSNs). However, we observe that ...
190
click to vote
CF
2007
ACM
15 years 10 months ago
2007
ACM
This paper presents a novel architectural technique to hide fetch latency overhead of hardware encrypted and authenticated memory. A number of recent secure processor designs have...
207
click to vote
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Finding an image’s exact GPS location is a challenging computer vision problem that has many real-world applications. In this paper, we address the problem of finding ...
181
click to vote
CASES
2006
ACM
15 years 10 months ago
2006
ACM
Probabilistic arithmetic, where the ith output bit of addition and multiplication is correct with a probability pi, is shown to be a vehicle for realizing extremely energy-efficie...