Results 181 to 190 of about 2,506 (223)
Some of the next articles are maybe not open access.
Nonuniform Compression in Databases with Haar Wavelet
2007 Data Compression Conference (DCC'07), 2007Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the data from the database. An efficient data synopsis must provide accurate information about the distribution of data to the query optimizer at any point in time.
Su Chen, Antonio Nucci
openaire +1 more source
Haar-Like Wavelets on Hierarchical Trees
Journal of Scientific ComputingzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rick Archibald, Ben Whitney
openaire +2 more sources
2019
It can be extended to \(\mathbb {R}\) by the periodicity of period 1. Each Haar function is continuous from the right and the Haar system H is orthonormal on [0, 1).
Yu. A. Farkov +2 more
openaire +1 more source
It can be extended to \(\mathbb {R}\) by the periodicity of period 1. Each Haar function is continuous from the right and the Haar system H is orthonormal on [0, 1).
Yu. A. Farkov +2 more
openaire +1 more source
Adaptive Haar Type Wavelets on Manifolds
Journal of Mathematical Sciences, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Haar wavelet method for solving Fisher’s equation
Applied Mathematics and Computation, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gokul Hariharan, K. Kannan, K. R. Sharma
openaire +1 more source
Selective Crypting with Haar-Wavelets
2000The coefficients of a wavelet—decomposition form into different levels according to the size of the described details. This can be utilized to crypt only a part of the given data while keeping the rest unchanged so that critical information is filtered out.
openaire +1 more source
Integration of Multivariate Haar Wavelet Series
2001This article considers the error of integrating multivariate Haar wavelet series by quasi-Monte Carlo rules using scrambled digital nets. Both the worst-case and random-case errors are analyzed. It is shown that scrambled net quadrature has optimal order. Moreover, there is a simple formula for the worst-case error.
Stefan Heinrich +2 more
openaire +1 more source
1999
This chapter explains the nature of the simplest wavelets and an algorithm to compute a fast wavelet transform. Such wavelets have been called “Haar’s wavelets” since Haar’s publication in 1910 (reference [19] in the bibliography). To analyze and synthesize a signal—which can be any array of data—in terms of simple wavelets, this chapter employs shifts
openaire +1 more source
This chapter explains the nature of the simplest wavelets and an algorithm to compute a fast wavelet transform. Such wavelets have been called “Haar’s wavelets” since Haar’s publication in 1910 (reference [19] in the bibliography). To analyze and synthesize a signal—which can be any array of data—in terms of simple wavelets, this chapter employs shifts
openaire +1 more source
Haar Wavelets is a Clifford Algebra
AIP Conference Proceedings, 2007The main idea is to construct a basis for the space L2([0,1]) that can be wrapped isomorphically onto a Clifford algebra Rm of dimension 2m (m going to infinity). The endomorphism algebra End(Rm), itself a Clifford algebra, is then used to encode bounded linear operators on L2([0,1]) such as the Haar wavelet transform.
F. Sommen +3 more
openaire +1 more source
Generalized Haar wavelets and frames
SPIE Proceedings, 2000Generalized Haar wavelets were introduced in connection with the problem of detecting specific periodic components in noisy signals. We showed that the non-normalized continuous wavelet transform of a periodic function taken with respect to a generalized Haar wavelet is periodic in time as well as in scale, and that generalized Haar wavelets are the ...
openaire +2 more sources