1464 search results - page 146 / 293 » On optimal anonymization for l -diversity |
188
click to vote
IISWC
2006
IEEE
16 years 16 days ago
2006
IEEE
— Data mining is the process of automatically finding implicit, previously unknown, and potentially useful information from large volumes of data. Recent advances in data extrac...
159
click to vote
IPPS
2006
IEEE
16 years 16 days ago
2006
IEEE
The growing computational and storage needs of several scientific applications mandate the deployment of extreme-scale parallel machines, such as IBM’s Blue Gene/L which can acc...
171
click to vote
FOCS
2005
IEEE
16 years 3 days ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
176
click to vote
GD
2005
Springer
16 years 1 days ago
2005
Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
160
click to vote
TACAS
2005
Springer
15 years 12 months ago
2005
Springer
We present MC2 , what we believe to be the first randomized, Monte Carlo algorithm for temporal-logic model checking, the classical problem of deciding whether or not a property s...