12 search results - page 1 / 3 » The Diameter of Randomly Perturbed Digraphs and Some Applica... |
APPROX
2004
Springer
13 years 11 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
WPES
2003
ACM
13 years 10 months ago
2003
ACM
Privacy is becoming an increasingly important issue in many data mining applications, particularly in the security and defense area. This has triggered the development of many pri...
CCCG
2008
13 years 7 months ago
2008
We consider a generalization of geometric range searching, with the goal of generating an informative "summary" of the objects contained in a query range via the applica...
ICCV
2011
IEEE
12 years 5 months ago
2011
IEEE
We propose a novel way to induce a random field from an energy function on discrete labels. It amounts to locally injecting noise to the energy potentials, followed by finding t...
TSMC
2011
13 years 14 days ago
2011
— Consider a scenario in which the data owner has some private/sensitive data and wants a data miner to access it for studying important patterns without revealing the sensitive ...