11949 search results - page 100 / 2390 » Some results on (a:b)-choosability |
101
click to vote
DAGSTUHL
1996
15 years 2 months ago
1996
The areas of On-Line Algorithms and Machine Learning are both concerned with problems of making decisions about the present based only on knowledge of the past. Although these area...
107
click to vote
JSYML
2008
15 years 1 months ago
2008
We say that A LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real , oracle B can also find patterns on . In o...
JGAA
2006
15 years 1 months ago
2006
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover ...
IAJIT
2011
14 years 8 months ago
2011
: This paper discusses the speech morphing process showing some limitations of using the directly obtained LPC and excitation parameters of speech. The algorithm here depends on ch...
101
click to vote
UAI
2001
15 years 2 months ago
2001
Common wisdom has it that small distinctions in the probabilities quantifying a belief network do not matter much for the results of probabilistic queries. Yet, one can develop re...