33 search results - page 4 / 7 » Building Very Large Neighbour-joining Trees |
TVCG
2011
13 years 2 months ago
2011
We present two novel algorithms for constructing spatial hierarchies on GPUs. The first is for kd-trees that automatically balances between the level of parallelism and total mem...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— Estimation of network proximity among nodes is an important building block in several applications like service selection and composition, multicast tree formation, and overlay...
KDD
2000
ACM
13 years 11 months ago
2000
ACM
Many organizations today have more than very large databases; they have databases that grow without limit at a rate of several million records per day. Mining these continuous dat...
KDD
2002
ACM
14 years 7 months ago
2002
ACM
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
ICAI
2007
13 years 8 months ago
2007
- NLM's Unified Medical Language System (UMLS) is a very large ontology of biomedical and health data. In order to be used effectively for knowledge processing, it needs to be...