16093 search results - page 3134 / 3219 » On the optimality of the neighbor-joining algorithm |
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
Labeling schemes lie at the core of query processing for many XML database management systems. Designing labeling schemes for dynamic XML documents is an important problem that ha...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
Existing work in the skyline literature focuses on optimizing the processing cost. This paper aims at minimization of the communication overhead in client-server architectures, wh...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...