1060 search results - page 117 / 212 » On the Discovery of Random Trees |
178
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
— This paper presents a methodology based on a variation of the Rapidly-exploring Random Trees (RRTs) that generates feasible trajectories for autonomous aerial vehicles with hol...
169
click to vote
ACL
2006
15 years 8 months ago
2006
We investigate generalizations of the allsubtrees "DOP" approach to unsupervised parsing. Unsupervised DOP models assign all possible binary trees to a set of sentences ...
209
click to vote
DAGSTUHL
1996
15 years 8 months ago
1996
We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the unsorted linear list, and the binary search tree. Fo...
152
click to vote
JSC
2006
15 years 6 months ago
2006
We provide a polyhedral description of the conditions for the existence of the maximum likelihood estimate (MLE) for a hierarchical log-linear model. The MLE exists if and only if...
230
click to vote
EMNLP
2011
14 years 6 months ago
2011
In this paper, we propose a novel approach to automatic generation of aspect-oriented summaries from multiple documents. We first develop an event-aspect LDA model to cluster sen...