AAAAAA

   
Results: 1-13 |
Results: 13
Complexity of the consistency problem for certain post classes
Authors: Shmulevich, I Gabbouj, M Astola, J
Citation: I. Shmulevich et al., Complexity of the consistency problem for certain post classes, IEEE SYST B, 31(2), 2001, pp. 251-253
Output distributions of stack filters based on mirrored threshold decomposition (vol 49, pg 1454, 2001)
Authors: Shmulevich, I Paredes, JL Arce, GR
Citation: I. Shmulevich et al., Output distributions of stack filters based on mirrored threshold decomposition (vol 49, pg 1454, 2001), IEEE SIGNAL, 49(9), 2001, pp. 2162-2162
Output distributions of stack filters based on mirrored threshold decomposition
Authors: Shmulevich, I Paredes, JL Arce, GR
Citation: I. Shmulevich et al., Output distributions of stack filters based on mirrored threshold decomposition, IEEE SIGNAL, 49(7), 2001, pp. 1454-1460
Block-median pyramidal transform: Analysis and denoising applications
Authors: Melnik, VP Shmulevich, I Egiazarian, K Astola, J
Citation: Vp. Melnik et al., Block-median pyramidal transform: Analysis and denoising applications, IEEE SIGNAL, 49(2), 2001, pp. 364-372
Simplified implementation of the recursive median sieve
Authors: Yli-Harja, O Koivisto, P Bangham, JA Cawley, G Harvey, R Shmulevich, I
Citation: O. Yli-harja et al., Simplified implementation of the recursive median sieve, SIGNAL PROC, 81(7), 2001, pp. 1565-1570
Breakdown probabilities of recursive stack filters
Authors: Koivisto, P Yli-Harja, O Niemisto, A Shmulevich, I
Citation: P. Koivisto et al., Breakdown probabilities of recursive stack filters, SIGNAL PROC, 81(1), 2001, pp. 227-231
Almost all monotone Boolean functions are polynomially learnable using membership queries
Authors: Shmulevich, I Korshunov, AD Astola, J
Citation: I. Shmulevich et al., Almost all monotone Boolean functions are polynomially learnable using membership queries, INF PROCESS, 79(5), 2001, pp. 211-213
The use of sample selection probabilities for stack filter design
Authors: Shmulevich, I Melnik, V Egiazarian, K
Citation: I. Shmulevich et al., The use of sample selection probabilities for stack filter design, IEEE SIG PL, 7(7), 2000, pp. 189-192
Measures of temporal pattern complexity
Authors: Shmulevich, I Povel, DJ
Citation: I. Shmulevich et Dj. Povel, Measures of temporal pattern complexity, J NEW M RES, 29(1), 2000, pp. 61-69
Localized key finding: Algorithms and applications
Authors: Shmulevich, I Yli-Harja, O
Citation: I. Shmulevich et O. Yli-harja, Localized key finding: Algorithms and applications, MUSIC PERC, 17(4), 2000, pp. 531-544
Near infrared spectrometry of milk in its heterogeneous state
Authors: Schmilovitch, Z Shmulevich, I Notea, A Maltz, E
Citation: Z. Schmilovitch et al., Near infrared spectrometry of milk in its heterogeneous state, COMP EL AGR, 29(3), 2000, pp. 195-207
Output distributions of recursive stack filters
Authors: Shmulevich, I Yli-Harja, O Egiazarian, K Astola, J
Citation: I. Shmulevich et al., Output distributions of recursive stack filters, IEEE SIG PL, 6(7), 1999, pp. 175-178
Modeling and experiment analysis of electrostatic date pollination
Authors: Bechar, A Shmulevich, I Eisikowitch, D Vaknin, Y Ronen, B Gan-Mor, S
Citation: A. Bechar et al., Modeling and experiment analysis of electrostatic date pollination, T ASAE, 42(6), 1999, pp. 1511-1516
Risultati: 1-13 |