101 search results - page 4 / 21 » An Efficient Algorithm for Solving the Dyck-CFL Reachability... |
SIGMOD
2009
ACM
14 years 7 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...
ICDAR
2003
IEEE
14 years 24 days 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 ...
ICDT
2007
ACM
13 years 11 months ago
2007
ACM
Abstract. We review key constraints in the context of XML as introduced by Buneman et al. We show that one of the proposed inference rules is not sound in general, and the axiomati...
ACSC
2002
IEEE
14 years 14 days ago
2002
IEEE
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...
TCBB
2008
13 years 7 months ago
2008
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...