2887 search results - page 237 / 578 » Name Generation and Linearity |
158
click to vote
ACL
2004
15 years 8 months ago
2004
We present a generative model for the unsupervised learning of dependency structures. We also describe the multiplicative combination of this dependency model with a model of line...
172
click to vote
NIPS
2001
15 years 8 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
159
click to vote
FLAIRS
2000
15 years 8 months ago
2000
With the increasing amount and complexity of data being collected, there is an urgent need to create automated techniques for mining the data. In particular, data being generated ...
183
click to vote
AAECC
2007
Springer
15 years 6 months ago
2007
Springer
We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the o...
173
click to vote
DM
2007
15 years 6 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 ...