Sciweavers

2767 search results - page 447 / 554
» Universal Exponentiation Algorithm
Sort
View
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 3 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
SMI
2005
IEEE
14 years 2 months ago
Two-Dimensional Visibility Charts for Continuous Curves
This paper considers computation of visibility for twodimensional shapes whose boundaries are C1 continuous curves. We assume we are given a one-parameter family of candidate view...
Gershon Elber, Robert Sayegh, Gill Barequet, Ralph...
ISAAC
2005
Springer
127views Algorithms» more  ISAAC 2005»
14 years 2 months ago
Decision Making Based on Approximate and Smoothed Pareto Curves
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
Heiner Ackermann, Alantha Newman, Heiko Rögli...
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
14 years 2 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith
SPW
2004
Springer
14 years 2 months ago
The Dancing Bear: A New Way of Composing Ciphers
This note presents a new way of composing cryptographic primitives which makes some novel combinations possible. For example, one can do threshold decryption using standard block c...
Ross Anderson