Sciweavers

491 search results - page 22 / 99
» Random Paintbrush Transformation
Sort
View
JMIV
2002
72views more  JMIV 2002»
14 years 9 months ago
Estimating Overcomplete Independent Component Bases for Image Windows
Estimating overcomplete ICA bases for image windows is a difficult problem. Most algorithms require the estimation of values of the independent components which leads to computatio...
Aapo Hyvärinen, Mika Inki
JC
2006
86views more  JC 2006»
14 years 10 months ago
Randomly shifted lattice rules for unbounded integrands
We study the problem of multivariate integration over Rd with integrands of the form f(x)d(x) where d is a probability density function. Practical problems of this form occur comm...
Frances Y. Kuo, Grzegorz W. Wasilkowski, Benjamin ...
IPPS
1998
IEEE
15 years 2 months ago
Sharing Random Bits with No Process Coordination
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
Marius Zimand
71
Voted
VTC
2007
IEEE
15 years 4 months ago
Mellin Transform Based Performance Analysis of FFH M-ary FSK Using Product Combining Against Partial Band Noise Jamming
— We propose a novel bit error ratio (BER) analysis technique for fast frequency hopping (FFH) assisted M-ary frequency shift keying (MFSK) using product combining (PC), when the...
Sohail Ahmed, Lie-Liang Yang, Lajos Hanzo
68
Voted
ICPR
2004
IEEE
15 years 11 months ago
Pattern Matching by Sequential Subdivision of Transformation Space
Pattern matching is a well-known pattern recognition technique. This paper proposes a novel pattern matching algorithm that searches transformation space by sequential subdivision...
Mingtian Ni, Stephen E. Reichenbach