23589 search results - page 4411 / 4718 » Uncheatable Distributed Computations |
140
Voted
VLDB
1997
ACM
15 years 10 months ago
1997
ACM
R-tree based spatial join is useful because of both its superior performance and the wide spread implementation of R-trees. We present a new R-tree join method called BFRJ (Breadt...
232
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...
164
click to vote
ASPLOS
1989
ACM
15 years 10 months ago
1989
ACM
A very long instruction word (VLIW) processorexploits parallelism by controlling multiple operations in a single instruction word. This paper describes the architecture and compil...
161
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 ...
192
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...