1060 search results - page 142 / 212 » On the Discovery of Random Trees |
77
Voted
JCSS
2006
14 years 10 months ago
2006
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...
122
Voted
COMBINATORICA
2011
13 years 10 months ago
2011
We prove several quantitative Ramseyan results involving ternary complete trees with {0, 1}-labeled edges where we attempt to find a complete binary subtree with as few labels as ...
119
click to vote
MOBIHOC
2001
ACM
15 years 9 months ago
2001
ACM
A Bluetooth ad hoc network can be formed by interconnecting piconets into scatternets. The constraints and properties of Bluetooth scatternets present special challenges in formin...
BMCBI
2010
14 years 10 months ago
2010
Background: Large datasets of protein interactions provide a rich resource for the discovery of Short Linear Motifs (SLiMs) that recur in unrelated proteins. However, existing met...
BMCBI
2008
14 years 10 months ago
2008
Background: Microarray technology provides an efficient means for globally exploring physiological processes governed by the coordinated expression of multiple genes. However, ide...