Sciweavers

4581 search results - page 11 / 917
» Computing Transformation Semigroups
Sort
View
TCS
2010
14 years 6 months ago
Monad transformers as monoid transformers
The incremental approach to modular monadic semantics constructs complex monads by using monad transformers to add computational features to a preexisting monad. A complication of...
Mauro Jaskelioff, Eugenio Moggi
APPML
2010
112views more  APPML 2010»
14 years 11 months ago
Computing Fourier transforms and convolutions of Sn-1-invariant signals on Sn in time linear in n
Let Sn denote the symmetric group on {1, . . . , n} and Sn-1 the stabilizer subgroup of n. We derive algorithms for computing Fourier transforms of left and right Sn-1-invariant s...
Michael Clausen, Ramakrishna Kakarala
53
Voted
ICIP
2007
IEEE
16 years 1 months ago
Incremental Refinement of Computation for the Discrete Wavelet Transform
Yiannis Andreopoulos, Mihaela van der Schaar
NA
2010
95views more  NA 2010»
14 years 6 months ago
A new algorithm for computing the Geronimus transformation with large shifts
Abstract A monic Jacobi matrix is a tridiagonal matrix which contains the parameters of the three-term recurrence relation satisfied by the sequence of monic polynomials orthogonal...
Maria Isabel Bueno Cachadina, Alfredo Deaño...
75
Voted
ERSHOV
2006
Springer
15 years 3 months ago
Program Generation in the Equivalent Transformation Computation Model Using the Squeeze Method
In the equivalent transformation (ET) computation model, a specification provides background knowledge in a problem domain, a program is a set of prioritized rewriting rules, and c...
Kiyoshi Akama, Ekawit Nantajeewarawat, Hidekatsu K...