| Computing with Haar functions |
| Full text |
Pdf
(412 KB)
|
| Source
|
Symposium on Applied Computing
archive
Proceedings of the 1997 ACM symposium on Applied computing
table of contents
San Jose, California, United States
Pages: 223 - 227
Year of Publication: 1997
ISBN:0-89791-850-9
|
|
Author
|
|
Sami Khuri
|
Department of Mathematics and Computer Science, San José State University, One Washington Square, San José, CA
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 16, Citation Count: 0
|
|
|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Beauchamp K. G., (1984), Applications of Walsh and Related Functions, Academic Press.
|
| |
2
|
|
| |
3
|
|
| |
4
|
Fino, B.j., (1972), Relations Between Haar and Walsh- Hadamard Transforms, Proc. IEEE (Letters), vol 60, pp. 647-648.
|
| |
5
|
Goldberg, D.E., (1989), Genetic Algorithms and Walsh Functions Part II: Deception and its Analysis, Complex Systems 3, pp. 153-171.
|
| |
6
|
Haar, A., (1910), Zur Theorie der Orthogonalen Funktionensysteme, Math. Annalen 69:331-371.
|
| |
7
|
Harmuth, H. F., (1968), A Generalized Concept of Frequency and Some Applications, IEEE Transactions on Information Theory, IT-14:375-382.
|
| |
8
|
|
| |
9
|
|
 |
10
|
|
 |
11
|
Sami Khuri , Thomas Bäck , Jörg Heitkötter, An evolutionary approach to combinatorial optimization problems, Proceedings of the 22nd annual ACM computer science conference on Scaling up : meeting the challenge of complexity in real-world computing applications: meeting the challenge of complexity in real-world computing applications, p.66-73, March 08-10, 1994, Phoenix, Arizona, United States
[doi> 10.1145/197530.197558]
|
| |
12
|
Kremer, H., (1973), On Theory of Fast Walsh Transform Algorithms, Colloquium on the Theory and Applications of Walsh and Other Non-Sinusoidal Functions, Hatfield, U.K.
|
| |
13
|
Roeser, P. R., and Jernigan, M. E., (1982), Fast Haar T~ansform Algorithms, IEEE Transactions on Computers C-31 no 2:175-177.
|
| |
14
|
Rudolf, G., (1994), Private communication reproduced in the Appendix.
|
INDEX TERMS
Primary Classification:
F.
Theory of Computation
F.2
ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
F.2.1
Numerical Algorithms and Problems
Subjects:
Computation of transforms (e.g., fast Fourier transform)
Additional Classification:
G.
Mathematics of Computing
G.1
NUMERICAL ANALYSIS
G.1.2
Approximation
Subjects:
Wavelets and fractals
I.
Computing Methodologies
I.2
ARTIFICIAL INTELLIGENCE
I.2.8
Problem Solving, Control Methods, and Search
Subjects:
Heuristic methods
General Terms:
Algorithms,
Design,
Measurement,
Performance,
Theory
Keywords:
Haar functions,
Walsh functions,
deceptive function,
fast transforms,
fitness functions
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|