785 search results - page 97 / 157 » Binary Join Trees |
ESA
1999
Springer
15 years 2 months ago
1999
Springer
A critical step in all quartet methods for constructing evolutionary trees is the inference of the topology for each set of four sequences (i.e. quartet). It is a well–known fact...
VLDB
1994
ACM
15 years 1 months ago
1994
ACM
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering followed by parallelization. We focus on the parallelization phase a...
AINA
2004
IEEE
15 years 1 months ago
2004
IEEE
IP multicasting has naturally been considered the ideal technique to be used with multimedia communications. Unfortunately, current multicast protocols do not consider the dynamic...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee that contains Atteson's...
140
click to vote
CIDR
2011
14 years 1 months ago
2011
Phase change memory (PCM) is an emerging memory technology with many attractive features: it is non-volatile, byte-addressable, 2–4X denser than DRAM, and orders of magnitude be...