Sciweavers

1174 search results - page 90 / 235
» Functional Trees
Sort
View
IANDC
2008
92views more  IANDC 2008»
13 years 10 months ago
Tree exploration with advice
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
BMCBI
2006
127views more  BMCBI 2006»
13 years 10 months ago
Construction of phylogenetic trees by kernel-based comparative analysis of metabolic networks
Background: To infer the tree of life requires knowledge of the common characteristics of each species descended from a common ancestor as the measuring criteria and a method to c...
Sok June Oh, Je-Gun Joung, Jeong Ho Chang, Byoung-...
INFOCOM
1997
IEEE
14 years 2 months ago
Performance Modelling of Reliable Multicast Transmission
Our aim is to investigate reliable transmission for multicast communication and explore its relationship to multicast routing. We derive two characterizations that enable the comp...
Jörg Nonnenmacher, Ernst Biersack
JAL
2002
113views more  JAL 2002»
13 years 9 months ago
A multivariate view of random bucket digital search trees
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, ...
CPC
1999
105views more  CPC 1999»
13 years 9 months ago
Total Path Length For Random Recursive Trees
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
Robert P. Dobrow, James Allen Fill