4908 search results - page 646 / 982 » On the Complexity of Optimal K-Anonymity |
192
click to vote
GECCO
2003
Springer
16 years 1 days ago
2003
Springer
Abstract. Feature extraction based on evolutionary search offers new possibilities for improving classification accuracy and reducing measurement complexity in many data mining and...
203
click to vote
ICDT
2003
ACM
16 years 1 days ago
2003
ACM
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
180
click to vote
LATIN
2010
Springer
15 years 12 months ago
2010
Springer
Consider a dark polygonal region in which intruders move freely, trying to avoid detection. A robot, which is equipped with a flashlight, moves along the polygon boundary to illum...
172
click to vote
PODS
2010
ACM
15 years 12 months ago
2010
ACM
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is wellknown, that these form a strict subclass of the robust class of re...
169
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the problem of testing functions for the property of being a k-junta (i.e., of depending on at most k variables). Fischer, Kindler, Ron, Safra, and Samorodnitsky (J. Co...