60 search results - page 2 / 12 » Approximating a Finite Metric by a Small Number of Tree Metr... |
JMIV
2006
13 years 7 months ago
2006
Abstract - Certain structure detection problems can be solved by sampling a parameter space for the different structures at a finite number of points and checking each point to see...
IJON
2008
13 years 7 months ago
2008
The Fisher-Rao metric for the focus of expansion is approximated, under the assumption that the focus is estimated from correspondences between two images taken by a translating ca...
FSTTCS
1993
Springer
13 years 11 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
RECOMB
2006
Springer
14 years 7 months ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
FFA
2008
13 years 7 months ago
2008
We consider metric results for the asymptotic behavior of the number of solutions of Diophantine approximation inequalities with restricted denominators for Laurent formal power s...