324 search results - page 8 / 65 » Distance Approximating Trees: Complexity and Algorithms |
SMA
2003
ACM
14 years 18 days ago
2003
ACM
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
JEA
2008
13 years 7 months ago
2008
As more and more genomes are sequenced, evolutionary biologists are becoming increasingly interested in evolution at the level of whole genomes, in scenarios in which the genome e...
ACL
2009
13 years 5 months ago
2009
Recently, there is a growing interest in working with tree-structured data in different applications and domains such as computational biology and natural language processing. Mor...
BIRD
2008
Springer
13 years 9 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
ESA
2003
Springer
14 years 17 days ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...