78 search results - page 16 / 16 » Covering minimum spanning trees of random subgraphs |
STOC
2007
ACM
14 years 4 months ago
2007
ACM
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
ICPR
2008
IEEE
13 years 10 months ago
2008
IEEE
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...