385 search results - page 5 / 77 » On higher-order perceptron algorithms |
CGF
2004
13 years 7 months ago
2004
We address in this paper the issue of computing diffuse global illumination solutions for animation sequences. The principal difficulties lie in the computational complexity of gl...
TWC
2011
13 years 2 months ago
2011
—This paper describes a new blind channel estimation algorithm for Space-Time Block Coded (STBC) systems. The proposed method exploits the statistical independence of sources bef...
POPL
1998
ACM
13 years 11 months ago
1998
ACM
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
WSCG
2003
13 years 8 months ago
2003
The computation of global illumination in a dynamic scene constitutes a real challenge in computer graphics. In radiosity algorithms, this problem is far from being easy, especial...
CADE
2003
Springer
14 years 7 months ago
2003
Springer
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...