656 search results - page 70 / 132 » Marrying Words and Trees |
118
Voted
IPL
2010
15 years 4 months ago
2010
We develop a data structure for maintaining a dynamic multiset that uses O(n lg lg n/ lg n) bits and O(1) words, in addition to the space required by the n elements stored, suppor...
197
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
131
click to vote
CORR
1998
Springer
15 years 5 months ago
1998
Springer
This paper presents trainable methods for generating letter to sound rules from a given lexicon for use in pronouncing out-ofvocabulary words and as a method for lexicon compressi...
172
click to vote
WWW
2004
ACM
16 years 6 months ago
2004
ACM
We propose new features and algorithms for automating Web-page classification tasks such as content recommendation and ad blocking. We show that the automated classification of We...
178
click to vote
RECOMB
2004
Springer
16 years 6 months ago
2004
Springer
We present new methods for reconstructing reticulate evolution of species due to events such as horizontal transfer or hybrid speciation; both methods are based upon extensions of...