Sciweavers

4908 search results - page 166 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
ICIP
2010
IEEE
15 years 3 months ago
Morphological wavelet transform with adaptive dyadic structures
We propose a two component method for denoising multidimensional signals, e.g. images. The first component uses a dynamic programing algorithm of complexity O(N log N) to find an ...
Zhen James Xiang, Peter J. Ramadge
PE
2011
Springer
266views Optimization» more  PE 2011»
15 years 1 months ago
Lumping partially symmetrical stochastic models
Performance and dependability evaluation of complex systems by means of dynamic stochastic models (e.g. Markov chains) may be impaired by the combinatorial explosion of their stat...
Souheib Baarir, Marco Beccuti, Claude Dutheillet, ...
INTERSPEECH
2010
15 years 1 months ago
Direct observation of pruning errors (DOPE): a search analysis tool
The search for the optimal word sequence can be performed efficiently even in a speech recognizer with a very large vocabulary and complex models. This is achieved using pruning m...
Volker Steinbiss, Martin Sundermeyer, Hermann Ney
SWARM
2010
SPRINGER
178views Optimization» more  SWARM 2010»
15 years 1 months ago
On artificial immune systems and swarm intelligence
Abstract This position paper explores the nature and role of two bio-inspired paradigms, namely Artificial Immune Systems (AIS) and Swarm Intelligence (SI). We argue that there are...
Jon Timmis, Paul S. Andrews, Emma Hart
TSP
2010
15 years 1 months ago
A Doppler robust max-min approach to radar code design
Abstract--This correspondence considers the problem of robust waveform design in the presence of colored Gaussian disturbance under a similarity and an energy constraint. We resort...
Antonio De Maio, Yongwei Huang, Marco Piezzo