1640 search results - page 84 / 328 » Conditional Independence Trees |
115
click to vote
SODA
2001
ACM
15 years 4 months ago
2001
ACM
Fast-converging methods for reconstructing phylogenetic trees require that the sequences characterizing the taxa be of only polynomial length, a major asset in practice, since rea...
134
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Resolution refinements called w-resolution trees with lemmas (WRTL) and with input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both WRTL and WRTI when there...
121
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. It is widely believed that the Internet's AS-graph degree distribution obeys a power-law form. However, it was recently argued that since Internet data is collected ...
135
Voted
CGI
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper presents a quasi-physically based approach for interactively simulating large-scale dynamic forest scenes under different wind conditions. We introduce theories from th...
138
click to vote
DAM
1999
15 years 3 months ago
1999
The achromatic number (G) of a graph G = (V, E) is the maximum k such that V has a partition V1, V2, . . . , Vk into independent sets, the union of no pair of which is independent...