1464 search results - page 54 / 293 » On optimal anonymization for l -diversity |
125
click to vote
AAAI
2008
15 years 8 months ago
2008
ptimality in Abstract Argumentation Iyad Rahwan 1 Faculty of Informatics, British University in Dubai P.O.Box 502216, Dubai, UAE 2 (Fellow) School of Informatics, University of Edi...
153
click to vote
CCCG
2007
15 years 7 months ago
2007
We consider the problem of searching a polygonal room with two guards starting at a specified door point. While maintaining mutual visibility and without crossing the door, the g...
138
click to vote
SODA
1997
ACM
15 years 7 months ago
1997
ACM
A hierarchical gradient of an unstructured mesh M0 is a sequence of meshes M1;...;Mk such that jMkj is smaller than a given threshold mesh size b. The gradient is well-conditioned...
139
click to vote
COMGEO
2008
ACM
15 years 6 months ago
2008
ACM
Given a set of points P Rd and value > 0, an -core-set S P has the property that the smallest ball containing S is within of the smallest ball containing P. This paper shows ...
192
click to vote
JMLR
2012
13 years 8 months ago
2012
Sparse additive models are families of d-variate functions with the additive decomposition f∗ = ∑j∈S f∗ j , where S is an unknown subset of cardinality s d. In this paper,...