2016 search results - page 71 / 404 » Megamaps: Construction and Examples |
143
click to vote
AAAI
1994
15 years 5 months ago
1994
or untagged treebanks. ' When trained on an untagged This paper presents a method for constructing deterministic Prolog parsers from corpora of parsed sentences. Our approach ...
104
click to vote
CODAS
1996
15 years 5 months ago
1996
ntic abstractions classification, aggregation and generalization are extremely useful for modeling complex situations containing time-independent events. This paper shows that the...
133
click to vote
CCCG
2009
15 years 5 months ago
2009
We investigate the relationship between geometric thickness and the thickness, outerthickness, and arboricity of graphs. In particular, we prove that all graphs with arboricity tw...
122
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We reexamine fundamental problems from computational geometry in the word RAM model, where input coordinates are integers that fit in a machine word. We develop a new algorithm fo...
132
Voted
IJFCS
2006
15 years 4 months ago
2006
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...