Sciweavers

366 search results - page 43 / 74
» Model-checking higher-order functions
Sort
View
CSREAESA
2004
15 years 1 months ago
CMOS Implementation of Phase-Encoded Complex-Valued Artificial Neural Networks
- The model of a simple perceptron using phase-encoded inputs and complex-valued weights is presented. Multilayer two-input and three-input complex-valued neurons (CVNs) are implem...
Howard E. Michel, David Rancour, Sushanth Iringent...
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
14 years 11 months ago
A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics
A "hybrid method", dedicated to asymptotic coefficient extraction in combinatorial generating functions, is presented, which combines Darboux's method and singulari...
Philippe Flajolet, Éric Fusy, Xavier Gourdo...
ICASSP
2011
IEEE
14 years 3 months ago
Global convergence of independent component analysis based on semidefinite programming relaxation
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
Shotaro Akaho, Jun Fujiki
BIRTHDAY
2004
Springer
15 years 3 months ago
On Models for Quantified Boolean Formulas
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
Hans Kleine Büning, Xishun Zhao
LFP
1994
113views more  LFP 1994»
15 years 1 months ago
Collecting More Garbage
We present a method, adapted to polymorphically typed functional languages, to detect and collect more garbage than existing GCs. It can be applied to strict or lazy higher order ...
Pascal Fradet