Sciweavers

534 search results - page 59 / 107
» Efficient polynomial L-approximations
Sort
View
AAAI
2000
13 years 9 months ago
Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...
Richard E. Korf, Weixiong Zhang
ESANN
2000
13 years 9 months ago
Parametric approach to blind deconvolution of nonlinear channels
A parametric procedure for the blind inversion of nonlinear channels is proposed, based on a recent method of blind source separation in nonlinear mixtures. Experiments show that ...
Jordi Solé i Casals, Anisse Taleb, Christia...
AAAI
1990
13 years 9 months ago
Tree Decomposition with Applications to Constraint Processing
This paper concerns the task of removing redundant information from a given knowledge base, and restructuring it in the form of a tree, so as to admit efficient problem solving ro...
Itay Meiri, Judea Pearl, Rina Dechter
CRYPTO
2010
Springer
186views Cryptology» more  CRYPTO 2010»
13 years 9 months ago
Additively Homomorphic Encryption with d-Operand Multiplications
The search for encryption schemes that allow to evaluate functions (or circuits) over encrypted data has attracted a lot of attention since the seminal work on this subject by Rive...
Carlos Aguilar Melchor, Philippe Gaborit, Javier H...
AUTOMATICA
2010
99views more  AUTOMATICA 2010»
13 years 8 months ago
Two nonlinear optimization methods for black box identification compared
: In this paper, two nonlinear optimization methods for the identification of nonlinear systems are compared. Both methods estimate all the parameters of a polynomial nonlinear sta...
Anne Van Mulders, Johan Schoukens, Marnix Volckaer...