Sciweavers

2774 search results - page 235 / 555
» Exploiting Deep Structure
Sort
View
203
Voted
IS
2008
15 years 6 months ago
Efficient memory representation of XML document trees
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...
Giorgio Busatto, Markus Lohrey, Sebastian Maneth
NAR
2007
235views more  NAR 2007»
15 years 6 months ago
PAR-3D: a server to predict protein active site residues
PAR-3D (http://sunserver.cdfd.org.in:8080/protease /PAR_3D/index.html) is a web-based tool that exploits the fact that relative juxtaposition of active site residues is a conserve...
Kshama Goyal, Debasisa Mohanty, Shekhar C. Mande
CIKM
2010
Springer
15 years 5 months ago
Improved index compression techniques for versioned document collections
Current Information Retrieval systems use inverted index structures for efficient query processing. Due to the extremely large size of many data sets, these index structures are u...
Jinru He, Junyuan Zeng, Torsten Suel
ISDA
2010
IEEE
15 years 4 months ago
Improving statistical parsing by linguistic regularization
Statistically-based parsers for large corpora, in particular the Penn Tree Bank (PTB), typically have not used all the linguistic information encoded in the annotated trees on whic...
Igor Malioutov, Robert C. Berwick
AAAI
2012
13 years 9 months ago
Planning in Factored Action Spaces with Symbolic Dynamic Programming
We consider symbolic dynamic programming (SDP) for solving Markov Decision Processes (MDP) with factored state and action spaces, where both states and actions are described by se...
Aswin Raghavan, Saket Joshi, Alan Fern, Prasad Tad...