1464 search results - page 293 / 293 » On optimal anonymization for l -diversity |
TSMC
2010
12 years 12 months ago
2010
Most existing camera placement algorithms focus on coverage and/or visibility analysis, which ensures that the object of interest is visible in the camera's field of view (FOV...
CIKM
2011
Springer
12 years 5 months ago
2011
Springer
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
STOC
2012
ACM
11 years 7 months ago
2012
ACM
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...