Sciweavers

1060 search results - page 118 / 212
» On the Discovery of Random Trees
Sort
View
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
15 years 7 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
BMCBI
2011
15 years 1 months ago
Taxon ordering in phylogenetic trees: a workbench test
Background: Phylogenetic trees are an important tool for representing evolutionary relationships among organisms. In a phylogram or chronogram, the ordering of taxa is not conside...
Francesco Cerutti, Luigi Bertolotti, Tony L. Goldb...
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
15 years 7 months ago
Stochastic analyses for online combinatorial optimization problems
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...
WCE
2007
15 years 7 months ago
QoS-aware Multicast Ad hoc On-Demand Distance Vector Routing
—Ad hoc networking will become a major technology for wireless connectivity beside the multimedia necessity within the next few years. There are too many applications where one-t...
Vida Lashkari B. O., Mehdi Dehghan
ISBI
2011
IEEE
14 years 10 months ago
Reliable cell tracking by global data association
Automated cell tracking in populations is important for research and discovery in biology and medicine. In this paper, we propose a cell tracking method based on global spatiotemp...
Ryoma Bise, Zhaozheng Yin, Takeo Kanade