685 search results - page 79 / 137 » Succinct Trees in Practice |
XSYM
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we designed efficient indexing structure for XML documents so that each basic XPath axis step is supported. The indexing structure is built on top of the B+ -tree wh...
ECOOP
1994
Springer
13 years 11 months ago
1994
Springer
Product configuration management is presented as a practical application for a prototype-based object model. Data model requirements for a configuration system are first introduced...
ACL
2008
13 years 9 months ago
2008
Conventional n-best reranking techniques often suffer from the limited scope of the nbest list, which rules out many potentially good alternatives. We instead propose forest reran...
BXML
2004
13 years 9 months ago
2004
: We present a grammar-based approach to specifying k-ary queries for XML documents. k-ary queries simultaneously locate k nodes of an input tree as specified by a given relation. ...
DAM
2006
13 years 7 months ago
2006
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...