534 search results - page 76 / 107 » Efficient polynomial L-approximations |
AAAI
2010
13 years 9 months ago
2010
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
NIPS
2008
13 years 9 months ago
2008
Inspired by the hierarchical hidden Markov models (HHMM), we present the hierarchical semi-Markov conditional random field (HSCRF), a generalisation of embedded undirected Markov ...
NIPS
2008
13 years 9 months ago
2008
In kernel-based regression learning, optimizing each kernel individually is useful when the data density, curvature of regression surfaces (or decision boundaries) or magnitude of...
NIPS
2008
13 years 9 months ago
2008
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depe...
AAAI
2006
13 years 9 months ago
2006
We present an algorithm that derives actions' effects and preconditions in partially observable, relational domains. Our algorithm has two unique features: an expressive rela...