112 search results - page 20 / 23 » The Performance of Phylogenetic Methods on Trees of Bounded ... |
VLDB
1995
ACM
13 years 11 months ago
1995
ACM
The spatial join operation is benchmarked using variants of well-known spatial data structures such as the R-tree, R-tree, R+-tree, and the PMR quadtree. The focus is on a spatia...
CORR
2006
Springer
13 years 7 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...
UAI
2008
13 years 9 months ago
2008
Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an interve...
3DIM
2003
IEEE
14 years 23 days ago
2003
IEEE
This paper describes a novel method which extends the search algorithm of a k-d tree for aligning and merging range images. If the nearest neighbor point is far from a query, many...
BIOINFORMATICS
2011
12 years 11 months ago
2011
We consider the problem of similarity queries in biological network databases. Given a database of networks, similarity query returns all the database networks whose similarity (i...