SITE MAP

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

SEARCH

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

SHORTCUT:


Computing the Walsh-Hadamard Transform

Tenth Seminar on Analysis of Algorithms
June 14, 2004 03:00 PM to 04:00 PM
Speakers:
VMath - The Next Generation for Math Lectures on Streaming Video

Abstract:

We analyze the performance of a family of algorithms for computing the Walsh-Hadamard transform. One aspect of performance is modeled by a family of reoccurence relations. Deterministic bounds on the solutions are obtained, and under natural random model, we find, asymptotically the expected values, variances, and also establish the CLT

Lecture #10601

Need help? Visit our help pages at http://www.msri.org/communications/vmath/hints

 


The video is in post production and will be posted shortly.




See more of our Streaming Videos on our main VMath - Streaming Video page.