1717 search results - page 241 / 344 » A Computable Spectral Theorem |
170
click to vote
ANTS
2010
Springer
15 years 9 months ago
2010
Springer
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
169
click to vote
ATAL
2006
Springer
15 years 9 months ago
2006
Springer
In this paper we propose a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is ext...
132
click to vote
ECAI
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. The use of a medical guideline can be seen as the execution of computational tasks, sequentially or in parallel, in the face of patient data. It has been shown that many ...
146
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
216
Voted
CANS
2008
Springer
15 years 7 months ago
2008
Springer
In a (r, n)-threshold secret sharing scheme, no group of (r - 1) colluding members can recover the secret value s. However, the number of colluders is likely to increase over time...