1060 search results - page 37 / 212 » On the Discovery of Random Trees |
KDD
1997
ACM
15 years 2 months ago
1997
ACM
An approach to defining actionability as a measure of interestingness of patterns is proposed. This approach is based on the concept of an action hierarchy which is defined as a t...
104
click to vote
RSA
2010
14 years 8 months ago
2010
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
SIGMETRICS
2004
ACM
15 years 3 months ago
2004
ACM
Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing ...
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
In this paper we investigate random forest based language model adaptation. Large amounts of out-of-domain data are used to grow the decision trees while very small amounts of in-...
WINET
2010
14 years 8 months ago
2010
Device discovery and connection establishment are fundamental to communication between two Bluetooth (BT) devices. In this paper, we give an analytical model of the time it takes f...