4171 search results - page 426 / 835 » Choice numbers of graphs |
164
click to vote
RSA
2008
15 years 6 months ago
2008
: ForasubsetS ofpositiveintegerslet (n, S)bethesetofpartitionsofnintosummands that are elements of S. For every (n, S), let Mn() be the number of parts, with multiplicity, that ...
145
click to vote
IANDC
2010
15 years 5 months ago
2010
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
175
click to vote
MT
2010
15 years 5 months ago
2010
In Minimum Error Rate Training (MERT), BLEU is often used as the error function, despite the fact that it has been shown to have a lower correlation with human judgment than other...
178
click to vote
NA
2010
15 years 5 months ago
2010
Quasi-Newton methods for solving singular systems of nonlinear equations are considered in this paper. Singular roots cause a number of problems in implementation of iterative met...
182
click to vote
PERCOM
2010
ACM
15 years 5 months ago
2010
ACM
The complexity of modern mobile phones makes it difficult for developers to understand the power consumption of their applications. Our measurement framework produces fine-graine...