—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
Robustness is a key attribute of spread spectrum (SS) watermarking scheme. It is significantly deteriorated if one tries to achieve high embedding rate keeping other parameters u...
Abstract Consider discrete time observations (X δ)1≤ ≤n+1 of the process X satisfying dXt = √ VtdBt, with Vt a one-dimensional positive diffusion process independent of the...
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
The previous link adaptation algorithms on ofdm based systems use equal modulation order for all sub carrier index within a block. For multimedia transmission using ofdm as the mo...