Sciweavers

2835 search results - page 247 / 567
» Automatic Question Answering
Sort
View
IJDMMM
2008
87views more  IJDMMM 2008»
15 years 6 months ago
Is an ordinal class structure useful in classifier learning?
In recent years, a number of machine learning algorithms have been developed for the problem of ordinal classification. These algorithms try to exploit, in one way or the other, t...
Jens C. Huhn, Eyke Hüllermeier
JAPLL
2008
95views more  JAPLL 2008»
15 years 6 months ago
A note on an extension of PDL
Recently visibly pushdown automata have been extended to so called k-phase multistack visibly pushdown automata (k-MVPAs). On the occasion of introducing kMVPAs, it has been asked...
Stefan Göller, Dirk Nowotka
CORR
2007
Springer
148views Education» more  CORR 2007»
15 years 6 months ago
Linear time algorithms for Clobber
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...
Vincent D. Blondel, Julien M. Hendrickx, Raphael M...
JGT
2006
81views more  JGT 2006»
15 years 6 months ago
A Ramsey-type result for the hypercube
We prove that for every fixed k and 5 and for sufficiently large n, every edge coloring of the hypercube Qn with k colors contains a monochromatic cycle of length 2 . This answer...
Noga Alon, Rados Radoicic, Benny Sudakov, Jan Vond...
JSYML
2006
62views more  JSYML 2006»
15 years 6 months ago
Uniform almost everywhere domination
Abstract. We explore the interaction between Lebesgue measure and dominating functions. We show, via both a priority construction and a forcing construction, that there is a functi...
Peter Cholak, Noam Greenberg, Joseph S. Miller