Sciweavers

1464 search results - page 27 / 293
» On optimal anonymization for l -diversity
Sort
View
CIAC
2006
Springer
278views Algorithms» more  CIAC 2006»
15 years 3 months ago
Covering a Set of Points with a Minimum Number of Lines
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
Magdalene Grantson, Christos Levcopoulos
AUSAI
2008
Springer
15 years 1 months ago
L-Diversity Based Dynamic Update for Large Time-Evolving Microdata
Data anonymization techniques based on enhanced privacy principles have been the focus of intense research in the last few years. All existing methods achieving privacy principles ...
Xiaoxun Sun, Hua Wang, Jiuyong Li
GIS
2007
ACM
16 years 27 days ago
Geometric algorithms for clearance based optimal path computation
Priyadarshi Bhattacharya, Marina L. Gavrilova
ICIP
1998
IEEE
16 years 1 months ago
Towards Optimal Scalability in Predictive Video Coding
Kenneth Rose, Shankar L. Regunathan
IEEEAMS
2003
IEEE
15 years 5 months ago
An Active Self-Optimizing Multiplayer Gaming Architecture
Venkatraman Ramakrishna, Max Robinson, Kevin Eusti...