3055 search results - page 31 / 611 » Randomized Search Trees |
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
CN
2007
13 years 9 months ago
2007
In this paper we develop a model for random walk-based search mechanisms in unstructured P2P networks. This model is used to obtain analytical expressions for the performance metr...
ICDM
2009
IEEE
13 years 6 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...
CISIS
2009
IEEE
14 years 3 months ago
2009
IEEE
This paper proposes a fast AND/OR tree search algorithm using a multiple-paths concurrent search method. Conventional heuristic AND/OR tree search algorithms expand nodes in only ...
NAACL
2010
13 years 6 months ago
2010
Recent work has proposed the use of an extracted tree grammar as the basis for treebank analysis and search queries, in which queries are stated over the elementary trees, which a...