Sciweavers

503 search results - page 7 / 101
» An Independence Relation for Sets of Secrets
Sort
View
IJAR
2008
106views more  IJAR 2008»
13 years 8 months ago
Probabilistic logic with independence
This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without and with independence. We then consider g...
Fabio Gagliardi Cozman, Cassio Polpo de Campos, Jo...
TCS
2008
13 years 8 months ago
Constructibility and decidability versus domain independence and absoluteness
We develop a unified framework for dealing with constructibility and absoluteness in set theory, decidability of relations in effective structures (like the natural numbers), and ...
Arnon Avron
NETWORKING
2004
13 years 9 months ago
Efficient, Authenticated, and Fault-Tolerant Key Agreement for Dynamic Peer Groups
We present an efficient authenticated and fault-tolerant protocol (AFTD) for tree-based key agreement. Our approach is driven by the insight that when a Diffie-Hellman blinded key ...
Li Zhou, Chinya V. Ravishankar
LREC
2008
121views Education» more  LREC 2008»
13 years 10 months ago
Prolexbase: a Multilingual Relational Lexical Database of Proper Names
This paper deals with a multilingual relational lexical database of proper name, Prolexbase, a free resource available on the CNRTL website. The Prolex model is based on two main ...
Denis Maurel
DAM
1999
119views more  DAM 1999»
13 years 8 months ago
On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
David Manlove