1060 search results - page 18 / 212 » On the Discovery of Random Trees |
ICDM
2009
IEEE
14 years 7 months ago
2009
IEEE
In this paper, we study the problem of constructing private classifiers using decision trees, within the framework of differential privacy. We first construct privacy-preserving ID...
SIAMCOMP
2002
14 years 9 months ago
2002
We consider sums of functions of subtrees of a random binary search tree, and obtain general laws of large numbers and central limit theorems. These sums correspond to random recur...
ICCNMC
2005
Springer
15 years 3 months ago
2005
Springer
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
ISCC
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper, we propose DINPeer, an optimized peer-to-peer (P2P) overlay network for service discovery by overcoming limitations in current multicast discovery approaches and P2...
CSREAPSC
2006
14 years 11 months ago
2006
- To overcome shortcomings of Exact Matching Method (EMM) and Substitute Description Method (SDM), an Inexact Matching Method Based on Ontology and Semantic Distance (OSDIMM) is in...