40 search results - page 7 / 8 » Faster subtree isomorphism |
ADBIS
2007
Springer
14 years 16 days ago
2007
Springer
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
INFOCOM
2003
IEEE
13 years 11 months ago
2003
IEEE
Abstract— This work presents a thorough investigation of the structure of multicast trees cut from the Internet and power-law topologies. Based on both generated topologies and r...
OPODIS
2004
13 years 7 months ago
2004
The main contribution of this paper is that it shows that it is possible to have reactive distributed trees for counting and balancing with no need for the user to fix manually any...
CSDA
2006
13 years 6 months ago
2006
The cost-complexity pruning generates nested subtrees and selects the best one. However, its computational cost is large since it uses holdout sample or cross-validation. On the o...
ICCAD
1997
IEEE
13 years 10 months ago
1997
IEEE
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...