نتایج جستجو برای: multiplicative mapping

تعداد نتایج: 211866  

2008
Zhifang Zhang Mulan Liu Yeow Meng Chee San Ling Huaxiong Wang

Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether or not there exist efficient constructions of strongly multiplicative LSSS from general LSSS. In this paper, we propose the new concept of a 3-multiplicative LSSS, and establish its relationship with strongly multiplic...

Journal: :IEEE Trans. Geoscience and Remote Sensing 2000
Michael J. Collins Jonathan Wiebe David A. Clausi

Spatial fluctuations in microwave backscatter may be an important piece of information in discriminating tree stands. However, the presence of speckle in synthetic aperture radar (SAR) image data is a barrier to the exploitation of image texture. We explored a new methodology that combines a recent adaptive speckle reduction algorithm by Lopes et al. [12] with a generic texture estimation schem...

2014
Richard Baraniuk Vishal M. Patel Glenn R. Easley Rama Chellappa Nasser M. Nasrabadi

Separated Component-Based Restoration of Speckled SAR Images Report Title Many coherent imaging modalities such as Synthetic Aperture Radar (SAR) suffer from a multiplicative noise commonly referred to as speckle which often makes the interpretation of data difficult. An effective strategy for speckle reduction is to use a dictionary that can sparsely represent the features in the speckled imag...

Journal: :International Journal of Engineering Science, Advanced Computing and Bio-Technology 2018

2008
Zhifang Zhang Mulan Liu Yeow Meng Chee San Ling Huaxiong Wang

Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether or not there exist efficient constructions of strongly multiplicative LSSS from general LSSS. In this paper, we propose the new concept of 3-multiplicative LSSS, and establish its relationship with strongly multiplicat...

2003
GABRIEL DEBS

We prove that the topological statement: “Any compact covering mapping between two Borel sets is inductively perfect” is equivalent to the set-theoretical statement: “ ∀α ∈ ωω , א 1 < א1”. The starting point of this work is the following topological problem: Problem. Is any compact covering mapping between two Borel spaces inductively perfect? We recall that if f : X → Y is a continuous and ont...

Journal: :Symmetry 2023

Stochastic partial differential equations have wide applications in various fields of science and engineering. This paper addresses the optical stochastic solitons other exact solutions through birefringent fibers for Biswas–Arshed equation with multiplicative white noise using modified extended mapping method. model contains many kinds soliton solutions, which are always symmetric or anti-symm...

Journal: :Mathematics 2023

In this paper, we take into account the coupled stochastic Korteweg–De Vries (CSKdV) equations in Itô sense. Using mapping method, new trigonometric, rational, hyperbolic, and elliptic solutions are obtained. These obtained can be applied to analysis of a wide variety crucial physical phenomena because KdV have important applications various fields physics engineering. Also, it is used design o...

Journal: :Medical image analysis 2012
Elsa D. Angelini Julie Delon Alpha Boubacar Bah Laurent Capelle Emmanuel Mandonnet

A differential analysis framework of longitudinal FLAIR MRI volumes is proposed, based on non-linear gray value mapping, to quantify low-grade glioma growth. First, MRI volumes were mapped to a common range of gray levels via a midway-based histogram mapping. This mapping enabled direct comparison of MRI data and computation of difference maps. A statistical analysis framework of intensity dist...

Journal: :Random Struct. Algorithms 2008
Jirí Matousek

The Johnson–Lindenstrauss lemma asserts that an n-point set in any Euclidean space can be mapped to a Euclidean space of dimension k = O(ε−2 log n) so that all distances are preserved up to a multiplicative factor between 1 − ε and 1 + ε. Known proofs obtain such a mapping as a linear map Rn → Rk with a suitable random matrix. We give a simple and self-contained proof of a version of the Johnso...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید