2750 search results - page 266 / 550 » The complexity of learning SUBSEQ(A) |
314
click to vote
ML
2011
ACM
15 years 1 months ago
2011
ACM
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
157
click to vote
MFCS
2004
Springer
16 years 4 hour ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
157
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
We describe Polynomial Conditional Random Fields for signal processing tasks. It is a hybrid model that combines the ability of Polynomial Hidden Markov models for modeling complex...
183
Voted
IJON
2002
15 years 6 months ago
2002
For a network of spiking neurons that encodes information in the timing of individual spike times, we derive a supervised learning rule, SpikeProp, akin to traditional errorbackpr...
291
click to vote
Publication
We present a new approach for activity modelling and anomaly detection based on non-parametric Gaussian Process (GP) models. Specifically, GP regression models are formulated to l...