1060 search results - page 146 / 212 » On the Discovery of Random Trees |
98
Voted
ISCC
2006
IEEE
15 years 4 months ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
ISAAC
1998
Springer
15 years 2 months ago
1998
Springer
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
101
Voted
AUSDM
2006
Springer
15 years 2 months ago
2006
Springer
In response to the rapid development of DNA Microarray technology, many classification methods have been used for Microarray classification. SVMs, decision trees, Bagging, Boostin...
83
Voted
EJC
2006
14 years 10 months ago
2006
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
93
Voted
MOBIHOC
2009
ACM
15 years 10 months ago
2009
ACM
The study in mobile ad-hoc networks (MANET) is facing challenges brought by recent discovery of non-exponential behavior of the inter-contact time distribution of mobile nodes. In...