Sciweavers

2214 search results - page 81 / 443
» complexity 2004
Sort
View
ISNN
2004
Springer
14 years 1 months ago
Sparse Bayesian Learning Based on an Efficient Subset Selection
Based on rank-1 update, Sparse Bayesian Learning Algorithm (SBLA) is proposed. SBLA has the advantages of low complexity and high sparseness, being very suitable for large scale pr...
Liefeng Bo, Ling Wang, Licheng Jiao
KES
2004
Springer
14 years 1 months ago
Towards Cortex Sized Artificial Nervous Systems
We characterize the size and complexity of the mammalian cortices of human, macaque, cat, rat, and mouse. We map the cortical structure onto a Bayesian confidence propagating neura...
Christopher Johansson, Anders Lansner
MFCS
2004
Springer
14 years 1 months ago
Approximating Boolean Functions by OBDDs
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
Andre Gronemeier
SAT
2004
Springer
99views Hardware» more  SAT 2004»
14 years 1 months ago
Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables
We define a collection of mappings that transform many-valued clausal forms into satisfiability equivalent Boolean clausal forms, analyze their complexity and evaluate them empir...
Carlos Ansótegui, Felip Manyà
DCC
2004
IEEE
13 years 11 months ago
Joint Source-Channel Decoding of Quasi-Arithmetic Codes
This paper addresses the issue of robust and joint source-channel decoding of quasiarithmetic codes. Quasi-arithmetic coding is a reduced precision and complexity implementation o...
Thomas Guionnet, Christine Guillemot