1099 search results - page 114 / 220 » On the Complexity of Computing Evolutionary Trees |
SODA
2004
ACM
14 years 11 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
ICNP
2006
IEEE
15 years 4 months ago
2006
IEEE
— The rising popularity of live IPTV has triggered renewed interest in P2P multicast. In particular, the simple and robust ‘swarming’ style of P2P multicast is currently favo...
ISCAPDCS
2003
14 years 11 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
ALGORITHMICA
2006
14 years 10 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
VRST
2009
ACM
15 years 4 months ago
2009
ACM
For the convenient reuse of large-scale 3D motion capture data, browsing and searching methods for the data should be explored. In this paper, an efficient indexing and retrieval...