2570 search results - page 13 / 514 » Fast Algorithms For The Computation Of Ranklets |
WSCG
2003
14 years 11 months ago
2003
In this paper, a recursive algorithm that can build complex tree structure quickly is presented briefly. The plant structural growth is based on a dual-scale automaton, in which ...
TIT
2008
14 years 9 months ago
2008
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
WEA
2010
Springer
15 years 4 months ago
2010
Springer
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
Computing the unit group and class group of a number field are two of the main tasks in computational algebraic number theory. Factoring integers reduces to solving Pell's eq...
RSS
2007
14 years 11 months ago
2007
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...