Sciweavers

1464 search results - page 110 / 293
» On optimal anonymization for l -diversity
Sort
View
JMLR
2006
89views more  JMLR 2006»
15 years 6 months ago
Lower Bounds and Aggregation in Density Estimation
In this paper we prove the optimality of an aggregation procedure. We prove lower bounds for aggregation of model selection type of M density estimators for the Kullback-Leibler d...
Guillaume Lecué
JMLR
2006
105views more  JMLR 2006»
15 years 6 months ago
Some Theory for Generalized Boosting Algorithms
We give a review of various aspects of boosting, clarifying the issues through a few simple results, and relate our work and that of others to the minimax paradigm of statistics. ...
Peter J. Bickel, Yaacov Ritov, Alon Zakai
IJCV
2002
188views more  IJCV 2002»
15 years 6 months ago
A Multiphase Level Set Framework for Image Segmentation Using the Mumford and Shah Model
We propose a new multiphase level set framework for image segmentation using the Mumford and Shah model, for piecewise constant and piecewise smooth optimal approximations. The pro...
Luminita A. Vese, Tony F. Chan
GECCO
2004
Springer
115views Optimization» more  GECCO 2004»
15 years 11 months ago
Robotic Control Using Hierarchical Genetic Programming
In this paper, we compare the performance of hierarchical GP methods (Automatically Defined Functions, Module Acquisition, Adaptive Representation through Learning) with the canon...
Marcin L. Pilat, Franz Oppacher
GECCO
2003
Springer
15 years 11 months ago
Secret Agents Leave Big Footprints: How to Plant a Cryptographic Trapdoor, and Why You Might Not Get Away with It
This paper investigates whether optimisation techniques can be used to evolve artifacts of cryptographic significance which are apparently secure, but which have hidden properties...
John A. Clark, Jeremy L. Jacob, Susan Stepney