1060 search results - page 116 / 212 » On the Discovery of Random Trees |
167
click to vote
COMBINATORICS
2002
15 years 6 months ago
2002
Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limit...
135
click to vote
IJISEC
2002
15 years 6 months ago
2002
Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a one-bit secret key which is informationtheoretically secure from t...
169
click to vote
MSWIM
2004
ACM
15 years 11 months ago
2004
ACM
In mobile ad hoc networks, node mobility causes links between nodes to break frequently, thus terminating the lifetime of the routes containing those links. An alternative route h...
173
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
A number of supervised learning methods have been introduced in the last decade. Unfortunately, the last comprehensive empirical evaluation of supervised learning was the Statlog ...
158
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
This paper extends previous work on the Skewing algorithm, a promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parit...