1464 search results - page 97 / 293 » On optimal anonymization for l -diversity |
145
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We present a general Bayesian framework for hyperparameter tuning in L2-regularized supervised learning models. Paradoxically, our algorithm works by first analytically integratin...
200
click to vote
ICPR
2000
IEEE
15 years 10 months ago
2000
IEEE
Textures are one of the basic features in visual searching and computational vision. In the literature, most of the attention has been focussed on the texture features with minima...
139
click to vote
COR
2006
15 years 6 months ago
2006
We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at tw...
160
click to vote
TOMACS
2002
15 years 6 months ago
2002
In this paper we consider a two-node tandem Jackson network. Starting from a given state, we are interested in estimating the probability that the content of the second buffer exc...
153
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
Recently proposed l1-regularized maximum-likelihood optimization methods for learning sparse Markov networks result into convex problems that can be solved optimally and efficien...