2512 search results - page 320 / 503 » Learning from Highly Structured Data by Decomposition |
148
click to vote
NIPS
1996
15 years 5 months ago
1996
Dynamic Programming, Q-learning and other discrete Markov Decision Process solvers can be applied to continuous d-dimensional state-spaces by quantizing the state space into an arr...
163
click to vote
IEEEPACT
2008
IEEE
15 years 10 months ago
2008
IEEE
Communication overheads are one of the fundamental challenges in a multiprocessor system. As the number of processors on a chip increases, communication overheads and the distribu...
116
click to vote
ECIS
2000
15 years 5 months ago
2000
Electronic relationships in the context of electronic commerce and especially in the context of electronic learning and teaching are on the rise. However, besides the well known te...
168
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: Cluster analysis is an important technique for the exploratory analysis of biological data. Such data is often high-dimensional, inherently noisy and contains outliers...
125
click to vote
FLAIRS
2001
15 years 5 months ago
2001
We present an objective approach for evaluating probability elicitation methods in probabilistic models. Our method draws on ideas from research on learning Bayesian networks: if ...