Sciweavers

974 search results - page 42 / 195
» pairing 2010
Sort
View
NAACL
2010
13 years 5 months ago
Movie Reviews and Revenues: An Experiment in Text Regression
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...
Mahesh Joshi, Dipanjan Das, Kevin Gimpel, Noah A. ...
WEA
2010
Springer
476views Algorithms» more  WEA 2010»
14 years 2 months ago
Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments
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...
Chris Whidden, Robert G. Beiko, Norbert Zeh
EJC
2010
13 years 7 months ago
Connectivity of chamber graphs of buildings and related complexes
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...
Anders Björner, Kathrin Vorwerk
JOI
2010
121views more  JOI 2010»
13 years 6 months ago
Consistent bibliometric rankings of authors and of journals
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...
Denis Bouyssou, Thierry Marchant
ACL
2010
13 years 5 months ago
Sparsity in Dependency Grammar Induction
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...
Jennifer Gillenwater, Kuzman Ganchev, João ...