4908 search results - page 83 / 982 » On the Complexity of Optimal K-Anonymity |
149
click to vote
ISCAS
2003
IEEE
15 years 11 months ago
2003
IEEE
In Exponentially-ModulatedFilter Bank (EMFB) the complex subfilters are generated from a real-valued prototype filter by multiplying the filter impulse response with complex expon...
165
click to vote
NIPS
1996
15 years 7 months ago
1996
In this paper we apply the method of complexity regularization to derive estimation bounds for nonlinear function estimation using a single hidden layer radial basis function netwo...
142
click to vote
ICIP
1997
IEEE
16 years 7 months ago
1997
IEEE
We develop a new approach to image denoising based on complexity regularization. This technique presents a flexible alternative to the more conventional l2 , l1 , and Besov regula...
153
click to vote
ICRA
2007
IEEE
16 years 17 days ago
2007
IEEE
— One of the most important problems in Mobile Robotics is to realise the complete robot’s autonomy. In order to achieve this goal several tasks have to be accomplished. Among ...
184
click to vote
ICA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Mutual information (MI) is a common criterion in independent component analysis (ICA) optimization. MI is derived from probability density functions (PDF). There are scen...