Sciweavers

4485 search results - page 250 / 897
» Equivalences on Observable Processes
Sort
View
ICS
2010
Tsinghua U.
16 years 1 months ago
Game Theory with Costly Computation: Formulation and Application to Protocol Security
: We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resu...
Joseph Y. Halpern, Rafael Pass
SI3D
2009
ACM
15 years 11 months ago
Approximating dynamic global illumination in image space
Physically plausible illumination at real-time framerates is often achieved using approximations. One popular example is ambient occlusion (AO), for which very simple and efficie...
Tobias Ritschel, Thorsten Grosch, Hans-Peter Seide...
CCS
2009
ACM
15 years 11 months ago
Computational soundness for key exchange protocols with symmetric encryption
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
Ralf Küsters, Max Tuengerthal
SIGIR
2009
ACM
15 years 11 months ago
Link analysis for private weighted graphs
Link analysis methods have been used successfully for knowledge discovery from the link structure of mutually linking entities. Existing link analysis methods have been inherently...
Jun Sakuma, Shigenobu Kobayashi
INFOCOM
2008
IEEE
15 years 10 months ago
Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
Changhee Joo, Xiaojun Lin, Ness B. Shroff