680 search results - page 15 / 136 » A randomized embedding algorithm for trees |
IWOCA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We analyze special random network models – so-called thickened trees – which are constructed by random trees where the nodes are replaced by local clusters. These obj...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Random Indexing K-tree is the combination of two algorithms suited for large scale document clustering. Keywords Random Indexing, K-tree, Dimensionality Reduction, B-tree, Search T...
COMPGEOM
1993
ACM
13 years 11 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
ML
2006
ACM
13 years 7 months ago
2006
ACM
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...