4137 search results - page 310 / 828 » On the number of matchings of a tree |
181
click to vote
ACL
1997
15 years 8 months ago
1997
Our goal is to identify the features that predict the occurrence and placement of discourse cues in tutorial explanations in order to aid in the automatic generation of explanatio...
173
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
173
click to vote
PR
2006
15 years 6 months ago
2006
Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are...
188
click to vote
COLING
2010
15 years 1 months ago
2010
Tree-based translation models, which exploit the linguistic syntax of source language, usually separate decoding into two steps: parsing and translation. Although this separation ...
182
click to vote
DAC
2008
ACM
16 years 7 months ago
2008
ACM
In this paper, we present DeFer -- a fast, high-quality and nonstochastic fixed-outline floorplanning algorithm. DeFer generates a non-slicing floorplan by compacting a slicing fl...