Results 171 to 180 of about 191,604 (213)
Some of the next articles are maybe not open access.

Haar-Like Wavelets on Hierarchical Trees

Journal of Scientific Computing
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rick Archibald, Ben Whitney
openaire   +3 more sources

Nonuniform Compression in Databases with Haar Wavelet

2007 Data Compression Conference (DCC'07), 2007
Data 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

Adaptive Haar Type Wavelets on Manifolds

Journal of Mathematical Sciences, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Selective Crypting with Haar-Wavelets

2000
The 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   +2 more sources

Haar wavelet method for solving Fisher’s equation

Applied Mathematics and Computation, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gokul Hariharan, K. Kannan, K. R. Sharma
openaire   +1 more source

Integration of Multivariate Haar Wavelet Series

2001
This 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

Haar’s Simple Wavelets

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

Haar Wavelets in Data Analysis

Advanced Materials Research, 2010
One century ago (1910), the Hungarian mathematician Alfred Haar introduced the simplest wavelets in approximation theory, which are now known as the Haar wavelets. This type of wavelets can effectively be used to fit data in statistical applications.
Yu Qin Sun   +2 more
openaire   +1 more source

Haar Wavelets is a Clifford Algebra

AIP Conference Proceedings, 2007
The 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

The Haar basis wavelet system

1998
The Haar basis is known since 1910. Here we consider the Haar basis on the real line IR and describe some of its properties which are useful for the construction of general wavelet systems. Let L2 (IR) be the space of all complex valued functions f on IR such that their L2-norm is finite: $$ \left\| {f\left\| {2 = \left( {\int_{ - \infty }^\infty {\
Wolfgang Härdle   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy