Sciweavers

6719 search results - page 311 / 1344
» A Generalization of Automatic Sequences
Sort
View
ITICSE
2003
ACM
15 years 6 months ago
The evaluation of electronic marking of examinations
This paper discusses an approach to the electronic (automatic) marking of examination papers, in particular, the extent to which it is possible to mark a candidate’s answers aut...
Pete Thomas
75
Voted
COLT
2004
Springer
15 years 6 months ago
Inferring Mixtures of Markov Chains
We define the problem of inferring a “mixture of Markov chains” based on observing a stream of interleaved outputs from these chains. We show a sharp characterization of the i...
Tugkan Batu, Sudipto Guha, Sampath Kannan
GECCO
2000
Springer
113views Optimization» more  GECCO 2000»
15 years 4 months ago
A Non-Linear Schema Theorem for Genetic Algorithms
We generalize Holland's Schema Theorem to the setting that genes are arranged, not necessarily in a linear sequence, but as the nodes in a connected graph. We have experiment...
William A. Greene
91
Voted
ACL
2003
15 years 2 months ago
Word Sense Disambiguation Using Pairwise Alignment
In this paper, we proposed a new supervised word sense disambiguation (WSD) method based on a pairwise alignment technique, which is used generally to measure a similarity between...
Koichi Yamashita, Keiichi Yoshida, Yukihiro Itoh
79
Voted
NA
2008
75views more  NA 2008»
15 years 22 days ago
Fourier series and the Lubkin W-transform
We discuss the effect of a particular sequence acceleration method, the Lubkin W-transform, on the partial sums of Fourier series. We consider a very general class of functions wit...
A. Jason Boggess, B. Eric Bunch, C. Charles N. Moo...