11949 search results - page 306 / 2390 » Some results on (a:b)-choosability |
100
click to vote
COMMA
2008
15 years 3 months ago
2008
Abstract Classical propositional logic is an appealing option for modelling argumentation but the computational viability of generating an argument is an issue. Here we propose ame...
110
click to vote
CSC
2008
15 years 3 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
105
click to vote
LREC
2010
15 years 3 months ago
2010
This paper describes the first TTS evaluation campaign designed for Spanish. Seven research institutions took part in the evaluation campaign and developed a voice from a common s...
124
Voted
MEDIAFORENSICS
2010
15 years 3 months ago
2010
This paper considers the security aspect of the robust zero-bit watermarking technique `Broken Arrows'(BA),1 which was invented and tested for the international challenge BOW...
111
click to vote
LREC
2008
15 years 3 months ago
2008
We report the results of an experiment to assess the ability of automated MT evaluation metrics to remain sensitive to variations in MT quality as the average quality of the compa...