𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A practical approximation algorithm for optimalk-anonymity

✍ Scribed by Batya Kenig; Tamir Tassa

Book ID
113064217
Publisher
Springer US
Year
2011
Tongue
English
Weight
912 KB
Volume
25
Category
Article
ISSN
1384-5810

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A parallel algorithm for approximate reg
A parallel algorithm for approximate regularity
✍ Laurence Boxer; Russ Miller πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 77 KB

Spatial regularity amidst a seemingly chaotic image is often meaningful. Many papers in computational geometry are concerned with detecting some type of regularity via exact solutions to problems in geometric pattern recognition. However, real-world applications often have data that is approximate,

Successive Approximate Algorithm for Bes
Successive Approximate Algorithm for Best Approximation from a Polyhedron
✍ Shusheng Xu πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 275 KB

Suppose K is the intersection of a finite number of closed half-spaces [K i ] in a Hilbert space X, and x # X "K. Dykstra's cyclic projections algorithm is a known method to determine an approximate solution of the best approximation of x from K, which is denoted by P K (x). Dykstra's algorithm redu