974 search results - page 42 / 195 » pairing 2010 |
130
click to vote
NAACL
2010
15 years 1 months ago
2010
We consider the problem of predicting a movie's opening weekend revenue. Previous work on this problem has used metadata about a movie--e.g., its genre, MPAA rating, and cast...
155
click to vote
WEA
2010
Springer
15 years 10 months ago
2010
Springer
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
139
click to vote
EJC
2010
15 years 3 months ago
2010
Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...
118
click to vote
JOI
2010
15 years 1 months ago
2010
Rankings of journals and rankings of scientists are usually discussed separately. We argue that a consistent approach to both rankings is desirable because both the quality of a j...
119
click to vote
ACL
2010
15 years 1 months ago
2010
A strong inductive bias is essential in unsupervised grammar induction. We explore a particular sparsity bias in dependency grammars that encourages a small number of unique depen...