115 search results - page 2 / 23 » Versioning Tree Structures by Path-Merging |
BMCBI
2007
13 years 4 months ago
2007
Background: By virtue of their shared ancestry, homologous sequences are similar in their structure and function. Consequently, multiple sequence alignments are routinely used to ...
PAMI
2011
12 years 11 months ago
2011
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
PPOPP
2012
ACM
12 years 10 days ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
FOCS
1996
IEEE
13 years 9 months ago
1996
IEEE
We study the tolerance of data structures to memory faults. We observe that many pointerbased data structures (e.g., linked lists, trees, etc.) are highly nonresilient to faults. ...
IWPSE
2007
IEEE
13 years 11 months ago
2007
IEEE
We present a method to detect and visualize evolution patterns in C++ source code. Our method consists of three steps. First, we extract an annotated syntax tree (AST) from each v...