Sciweavers

960 search results - page 101 / 192
» Optimal Monte Carlo Algorithms
Sort
View
ICASSP
2010
IEEE
13 years 10 months ago
A robust minimum volume enclosing simplex algorithm for hyperspectral unmixing
Hyperspectral unmixing is a process of extracting hidden spectral signatures (or endmembers) and the corresponding proportions (or abundances) of a scene, from its hyperspectral o...
Arul-Murugan Ambikapathi, Tsung-Han Chan, Wing-Kin...
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 10 months ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys
TSP
2008
88views more  TSP 2008»
13 years 10 months ago
Statistical Performance of MUSIC-Like Algorithms in Resolving Noncircular Sources
Abstract--This paper addresses the resolution of the conventional and noncircular MUSIC algorithms for arbitrary circular and noncircular second-order distributions of two uncorrel...
Habti Abeida, Jean Pierre Delmas
ICASSP
2011
IEEE
13 years 1 months ago
Two effective and computationally efficient pure-pixel based algorithms for hyperspectral endmember extraction
Endmember extraction is of prime importance in the process of hyperspectral unmixing so as to study the mineral composition of a landscape from its hyperspectral observations. Tho...
Arul-Murugan Ambikapathi, Tsung-Han Chan, Chong-Yu...
DAC
2009
ACM
14 years 11 months ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...