Sciweavers

2887 search results - page 56 / 578
» Name Generation and Linearity
Sort
View
FOCS
2002
IEEE
15 years 11 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich
NIPS
2004
15 years 7 months ago
Linear Multilayer Independent Component Analysis for Large Natural Scenes
In this paper, linear multilayer ICA (LMICA) is proposed for extracting independent components from quite high-dimensional observed signals such as large-size natural scenes. Ther...
Yoshitatsu Matsuda, Kazunori Yamaguchi
WSCG
2003
170views more  WSCG 2003»
15 years 7 months ago
Shading by Spherical Linear Interpolation using De Moivre's Formula
In the classical shading algorithm according to Phong, the normal is interpolated across the scanline, requiring a computationally expensive normalization in the inner loop. In th...
Anders Hast, Tony Barrera, Ewert Bengtsson
DC
2010
15 years 6 months ago
Distributed algorithms for ultrasparse spanners and linear size skeletons
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
Seth Pettie
ICITS
2009
15 years 3 months ago
Linear Threshold Multisecret Sharing Schemes
In a multisecret sharing scheme, several secret values are distributed among a set of n users, and each secret may have a different associated access structure. We consider here un...
Oriol Farràs, Ignacio Gracia, Sebasti&agrav...