1099 search results - page 199 / 220 » On the Complexity of Computing Evolutionary Trees |
139
click to vote
3DIM
2005
IEEE
15 years 10 months ago
2005
IEEE
The computational cost of a collision detection (CD) algorithm on polygonal surfaces depends highly on the complexity of the models. A novel “locally refined” approach is intr...
123
click to vote
CIE
2005
Springer
15 years 10 months ago
2005
Springer
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
125
click to vote
ERCIMDL
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The Multivalent Document Model offers a practical, proven, nocompromises architecture for preserving digital documents of potentially any data format. We have implemented...
139
click to vote
GD
2005
Springer
15 years 10 months ago
2005
Springer
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
131
click to vote
WINE
2005
Springer
15 years 10 months ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...