3020 search results - page 4 / 604 » Optimal partition trees |
84
Voted
RECOMB
1997
Springer
15 years 1 months ago
1997
Springer
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...
ICDAR
2003
IEEE
15 years 2 months ago
2003
IEEE
This paper proposes a binary classification tree aiming at solving multi-class classification problems using binary classifiers. The tree design is achieved in a way that a class ...
113
Voted
DASFAA
2004
IEEE
15 years 1 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
VLDB
1995
ACM
15 years 1 months ago
1995
ACM
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering and query rewrite (JOQR) followed by parallelization. We focus on t...
98
Voted
DEXA
2010
Springer
14 years 7 months ago
2010
Springer
We researched to try to find a way to reduce the cost of nearest neighbor searches in metric spaces. Many similarity search indexes recursively divide a region into subregions by u...