621 search results - page 45 / 125 » Parsing As Tree Traversal |
121
Voted
IS
2008
15 years 16 days ago
2008
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
95
Voted
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...
111
Voted
XSYM
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. The extensible markup language XML has become the de facto standard for information representation and interchange on the Internet. XML parsing is a core operation perfor...
115
Voted
AAAI
2011
14 years 16 days ago
2011
We propose Tree Sequence Kernel (TSK), which implicitly exhausts the structure features of a sequence of subtrees embedded in the phrasal parse tree. By incorporating the capabili...
107
Voted
AAAI
2012
13 years 2 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...