503 search results - page 53 / 101 » An Independence Relation for Sets of Secrets |
DLOG
2007
15 years 5 days ago
2007
We introduce a description language for specifying partial ordering relations over concept descriptions in description logics, and show how the language can be used in combination ...
SEBD
2008
14 years 11 months ago
2008
Collaborative information systems in a P2P scenario are characterized by a set of independent peers that dynamically need to cooperate by sharing data and services. For effective c...
NIPS
2000
14 years 11 months ago
2000
The principle of maximizing mutual information is applied to learning overcomplete and recurrent representations. The underlying model consists of a network of input units driving...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
The fitness landscape of a problem is the relation between the solution candidates and their reproduction probability. In order to understand optimization problems, it is essenti...
AAECC
2006
Springer
14 years 10 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...