675 search results - page 100 / 135 » On Compression of Parse Trees |
168
click to vote
EGPGV
2004
Springer
15 years 9 months ago
2004
Springer
We present a new parallel multiresolution volume rendering algorithm for visualizing large data sets. Using the wavelet transform, the raw data is first converted into a multires...
116
click to vote
SAC
2002
ACM
15 years 4 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
161
click to vote
LREC
2008
15 years 5 months ago
2008
We propose two general and robust methods for enriching resources annotated in the Frame Semantic paradigm with syntactic dependency graphs, which can provide useful additional in...
148
click to vote
CORR
1999
Springer
15 years 4 months ago
1999
Springer
Corpus-based grammar induction generally relies on hand-parsed training data to learn the structure of the language. Unfortunately, the cost of building large annotated corpora is...
176
click to vote
INTERSPEECH
2010
14 years 11 months ago
2010
Stochastic dependency parsers can achieve very good results when they are trained on large corpora that have been manually annotated. Active learning is a procedure that aims at r...