316 search results - page 16 / 64 » Bounded Depth Data Trees |
DAGSTUHL
2006
13 years 10 months ago
2006
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...
ALGORITHMICA
1999
13 years 8 months ago
1999
We analyze the performance of the popular class of neighbor-joining methods of phylogeny reconstruction. In particular, we find conditions under which these methods will determine ...
CVPR
2008
IEEE
14 years 11 months ago
2008
IEEE
We present a fully probabilistic stick-figure model that uses a nonparametric Bayesian distribution over trees for its structure prior. Sticks are represented by nodes in a tree i...
IJCAI
2003
13 years 10 months ago
2003
This paper presents a novel, promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parity functions. Lookahead is the st...
VRCAI
2006
ACM
14 years 3 months ago
2006
ACM
We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AAB...