Sciweavers

3040 search results - page 77 / 608
» Independent Natural Extension
Sort
View
CRYPTO
2000
Springer
149views Cryptology» more  CRYPTO 2000»
14 years 1 months ago
A Cryptographic Solution to a Game Theoretic Problem
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
Yevgeniy Dodis, Shai Halevi, Tal Rabin
EDCC
2010
Springer
14 years 1 months ago
D2HT: The Best of Both Worlds, Integrating RPS and DHT
Distributed Hash Tables (DHTs) and Random Peer Sampling (RPS) provide important and complementary services in the area of P2P overlay networks. DHTs achieve efficient lookup whil...
Marin Bertier, François Bonnet, Anne-Marie ...
AIML
2006
13 years 10 months ago
Bisimulation Quantified Modal Logics: Decidability
Bisimulation quantifiers are a natural extension of modal logics. They preserve the bisimulation invariance of modal logic, while allowing monadic second-order expressivity. Unfort...
Tim French
ICML
2008
IEEE
14 years 10 months ago
ICA and ISA using Schweizer-Wolff measure of dependence
We propose a new algorithm for independent component and independent subspace analysis problems. This algorithm uses a contrast based on the Schweizer-Wolff measure of pairwise de...
Barnabás Póczos, Sergey Kirshner
CSL
2007
Springer
14 years 3 months ago
Propositional Logic for Circuit Classes
Abstract. By introducing a parallel extension rule that is aware of independence of the introduced extension variables, a calculus for quantified propositional logic is obtained w...
Klaus Aehlig, Arnold Beckmann