Sciweavers

359 search results - page 51 / 72
» On Complete Primitives for Fairness
Sort
View
IWFM
2003
13 years 8 months ago
Using Admissible Interference to Detect Denial of Service Vulnerabilities
Meadows recently proposed a formal cost-based framework for analysis of denial of service. It was showed how some principles that have already been used to make cryptographic prot...
Stéphane Lafrance, John Mullins
CORR
2008
Springer
208views Education» more  CORR 2008»
13 years 7 months ago
Equilibria, Fixed Points, and Complexity Classes
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
Mihalis Yannakakis
CN
2006
117views more  CN 2006»
13 years 7 months ago
Using equivalence-checking to verify robustness to denial of service
In this paper, we introduce a new security property which intends to capture the ability of a cryptographic protocol being resistant to denial of service. This property, called im...
Stéphane Lafrance
RAS
2006
138views more  RAS 2006»
13 years 7 months ago
From pixels to multi-robot decision-making: A study in uncertainty
Mobile robots must cope with uncertainty from many sources along the path from interpreting raw sensor inputs to behavior selection to execution of the resulting primitive actions...
Peter Stone, Mohan Sridharan, Daniel Stronger, Gre...
TOG
2008
145views more  TOG 2008»
13 years 7 months ago
Real-time KD-tree construction on graphics hardware
We present an algorithm for constructing kd-trees on GPUs. This algorithm achieves real-time performance by exploiting the GPU's streaming architecture at all stages of kd-tr...
Kun Zhou, Qiming Hou, Rui Wang 0004, Baining Guo