1464 search results - page 149 / 293 » On optimal anonymization for l -diversity |
202
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
We describe online algorithms for learning a rotation from pairs of unit vectors in Rn . We show that the expected regret of our online algorithm compared to the best fixed rotati...
197
click to vote
MOC
2011
15 years 1 months ago
2011
Abstract. In this paper, we analyze a hybridizable discontinuous Galerkin method for numerically solving the Stokes equations. The method uses polynomials of degree k for all the c...
152
click to vote
TIT
2011
15 years 1 months ago
2011
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
127
click to vote
SIAMNUM
2010
15 years 1 months ago
2010
We consider the convergence of a volume corrected characteristics-mixed method (VCCMM) for advection-diffusion systems. It is known that, without volume correction, the method is f...
163
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Conditional Random Fields (CRFs) have proven to perform well on natural language processing tasks like name transliteration, concept tagging or grapheme-to-phoneme (g2p) conversio...