142 search results - page 14 / 29 » Matrix Trees |
105
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
SPAA
1993
ACM
15 years 3 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
SIGMETRICS
2006
ACM
15 years 5 months ago
2006
ACM
A new methodology to assess transient performance measures of tree-like processes is proposed by introducing the concept of tree-like processes with marked time epochs. As opposed...
90
Voted
ICRA
2005
IEEE
15 years 5 months ago
2005
IEEE
— This paper presents the novel insight that the SLAM information matrix is exactly sparse in a delayedstate framework. Such a framework is used in view-based representations of ...
BMCBI
2010
14 years 12 months ago
2010
Background: Phylogenetic relationships between genes are not only of theoretical interest: they enable us to learn about human genes through the experimental work on their relativ...