Sciweavers

16430 search results - page 782 / 3286
» On Computable Tree Functions
Sort
View
IWINAC
2007
Springer
16 years 1 months ago
Brain Organization and Computation
Theories of how the brain computes can be differentiated in three general conceptions: the algorithmic approach, the neural information processing (neurocomputational) approach an...
Andreas Schierwagen
ISSAC
1997
Springer
125views Mathematics» more  ISSAC 1997»
15 years 11 months ago
A Modular Algorithm for Computing Greatest Common Right Divisors of Ore Polynomials
Abstract. This paper presents a modular algorithm for computing the greatest common right divisor (gcrd) of two univariate Ore polynomials over Z[t]. The subresultants of Ore polyn...
Ziming Li, István Nemes
GECCO
2007
Springer
174views Optimization» more  GECCO 2007»
15 years 11 months ago
Classifier systems that compute action mappings
The learning in a niche based learning classifier system depends both on the complexity of the problem space and on the number of available actions. In this paper, we introduce a ...
Pier Luca Lanzi, Daniele Loiacono
FPL
2006
Springer
95views Hardware» more  FPL 2006»
15 years 11 months ago
Automation of IP Core Interface Generation for Reconfigurable Computing
Pre-designed IP cores for FPGAs represent a huge intellectual and financial wealth that must be leveraged by any high-level tool targeting reconfigurable platforms. In this paper ...
Zhi Guo, Abhishek Mitra, Walid A. Najjar
ASIACRYPT
2008
Springer
15 years 9 months ago
Graph Design for Secure Multiparty Computation over Non-Abelian Groups
Recently, Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups. They considered the passive adversary model and they assumed that the...
Xiaoming Sun, Andrew Chi-Chih Yao, Christophe Tart...