1060 search results - page 13 / 212 » On the Discovery of Random Trees |
SRDS
2008
IEEE
15 years 4 months ago
2008
IEEE
The efficiency of service discovery is critical in the development of fully decentralized middleware intended to manage large scale computational grids. This demand influenced t...
CPC
2002
14 years 9 months ago
2002
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
103
click to vote
AINA
2006
IEEE
15 years 4 months ago
2006
IEEE
Efficient service discovery in dynamic, crossorganizational VO is one of the challenge aspects in ChinaGrid. Network overlay and search algorithms are two important considerations...
SAC
2004
ACM
15 years 3 months ago
2004
ACM
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
BMCBI
2004
14 years 9 months ago
2004
Background: Clustering is one of the most commonly used methods for discovering hidden structure in microarray gene expression data. Most current methods for clustering samples ar...