2440 search results - page 214 / 488 » Data-Intensive Question Answering |
122
click to vote
IJDMMM
2008
15 years 4 months ago
2008
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...
131
click to vote
JAPLL
2008
15 years 4 months ago
2008
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...
149
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
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...
141
click to vote
DM
2007
15 years 4 months ago
2007
A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
129
click to vote
JGT
2006
15 years 4 months ago
2006
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...