16430 search results - page 74 / 3286 » On Computable Tree Functions |
149
click to vote
SI3D
1995
ACM
15 years 6 months ago
1995
ACM
This paper presents an algorithm for shadow calculation in dynamic polyhedral scenes illuminated by point light sources. It is based on a modi cation of Shadow Volume Binary Space...
116
click to vote
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
104
click to vote
COMBINATORICS
2006
15 years 2 months ago
2006
Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum...
106
click to vote
IFIP
2004
Springer
15 years 7 months ago
2004
Springer
We consider the problem of computing the optimal swap edges of a shortest-path tree. This theoretical problem arises in practice in systems that offer point-offailure shortest-path...
143
click to vote
INFOCOM
2010
IEEE
15 years 10 days ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...