نتایج جستجو برای: additive algorithm

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

2012
Jigar Shah Satish Shah

The speech enhancement techniques are required to improve the speech signal quality without causing any offshoot in many applications. Recently the growing use of cellular and mobile phones, hands free systems, VoIP phones, voice messaging service, call service centers etc. require efficient real time speech enhancement and detection strategies to make them superior over conventional speech com...

2015
Xiaoming Luo Frank Peters Robert Stephenson John Jackman Douglas Gemmill

ix CHAPTER 1. GENERAL INTRODUCTION 1 1.1 Background 1 1.2 Motivation 4 1.3 Research Objectives 5 1.4 Dissertation Outline 6 CHAPTER 2. LITERATURE REVIEW 7 2.1 Rapid Prototyping Application in Pattern & Mold Manufacturing 7 2.2 Layer Thickness Algorithm 14 2.3 Tool Size and Machining Parameter Selection 17 2.4 Cutting Force Models 22 2.5 Thin Material Machining 23 2.6 Machining Error Prediction ...

Journal: :IEEE Trans. Signal Processing 1999
Joseph M. Francos Benjamin Friedlander

Amplitude Polynomial Phase Signals Joseph M. Francos and Benjamin Friedlander Abstract Phase information has fundamental importance in many two-dimensional signal processing problems. In this paper we consider two-dimensional signals with random amplitude and a continuous deterministic phase. The signal is represented by a random amplitude polynomial-phase model. A computationally e cient estim...

Journal: :IJCSA 2011
Jan Vanus

The voice communication between humans and machines is the idea people have been thinking about a long time. For high level of the voice communication with the control system it is important to ensure good quality of the speech signal processing with additive noise in real environments. This paper describes a proposed method for optimal adjustment parameters of the adaptive filter with an LMS a...

2012
R. C. de Oliveira Ricardo M. Campello de Souza Hélio Magalhães de Oliveira

Abstract— A new fast algorithm for computing the discrete Hartley transform (DHT) is presented, which is based on the expansion of the transform matrix. The algorithm presents a better performance, in terms of multiplicative complexity, than previously known fast Hartley transform algorithms and same performance, in terms of additive complexity, than Split-Radix algorithm. A detailed descriptio...

2005
MAHA M. EL CHOUBASSI

Sensitivity analysis attacks constitute a known family of watermark “removal” attacks exploiting a vulnerability in some watermarking protocols: the attacker’s unlimited access to the watermark detector. In this work, novel attacks on additive spread spectrum schemes are designed. We first examine a well-known algorithm by Kalker et al., and prove its convergence using the law of large numbers;...

2013
Stéphane GOUTTE Nadia OUDJANE Francesco RUSSO

For a large class of vanilla contingent claims, we establish an explicit Föllmer-Schweizer decomposition when the underlying is an exponential of an additive process. This allows to provide an efficient algorithm for solving the mean variance hedging problem. Applications to models derived from the electricity market are performed.

2012
Hao Yang Jianxin Wu

For classification problems with millions of training examples or dimensions, accuracy, training and testing speed and memory usage are the main concerns. Recent advances have allowed linear SVM to tackle problems with moderate time and space cost, but for many tasks in computer vision, additive kernels would have higher accuracies. In this paper, we propose the PmSVM-LUT algorithm that employs...

2003
Jun-ichi Inoue

Average case performance of the deterministic annealing EM algorithm is evaluated for Gaussian mixture estimation problem under some additive noises. The data-averaged EM update equations with respect to hyperparameters are calculated analytically in the large data limit. We find that the EM algorithm strongly depends on the initial conditions. Moreover, by using our analysis, it becomes possib...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده برق و الکترونیک 1390

there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...

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

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