3628 search results - page 87 / 726 » The Decision Diffie-Hellman Problem |
IFIP
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. We consider two standard notions in formal security protocol analysis: message deducibility and static equivalence under equational theories. We present polynomial-time a...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
CODES
2006
IEEE
14 years 3 months ago
2006
IEEE
The use of Application Specific Instruction-set Processors (ASIP) is a solution to the problem of increasing complexity in embedded systems design. One of the major challenges in...
WSC
1997
13 years 10 months ago
1997
The problem of selecting the best system from a finite set of alternatives is considered from a Bayesian decision-theoretic perspective. The framework presented is quite general,...
HCI
2009
13 years 6 months ago
2009
Sign language (SL) recognition modules in human-computer interaction systems need to be both fast and reliable. In cases where multiple sets of features are extracted from the SL d...